【24h】

Metadata distribution algorithm based on directory hash in mass storage system

机译:大容量存储系统中基于目录哈希的元数据分配算法

获取原文
获取原文并翻译 | 示例

摘要

The distribution of metadata is very important in mass storage system. Many storage systems use subtree partition or hash algorithm to distribute the metadata among metadata server cluster. Although the system access performance is improved, the scalability problem is remarkable in most of these algorithms. This paper proposes a new directory hash (DH) algorithm. It treats directory as hash key value, implements a concentrated storage of metadata, and take a dynamic load balance strategy. It improves the efficiency of metadata distribution and access in mass storage system by hashing to directory and placing metadata together with directory granularity. DH algorithm has solved the scalable problems existing in file hash algorithm such as changing directory name or permission, adding or removing MDS from the cluster, and so on. DH algorithm reduces the additional request amount and the scale of each data migration in scalable operations. It enhances the scalability of mass storage system remarkably.
机译:元数据的分布在大容量存储系统中非常重要。许多存储系统使用子树分区或哈希算法在元数据服务器群集之间分配元数据。尽管提高了系统访问性能,但是在大多数这些算法中,可伸缩性问题仍然很突出。本文提出了一种新的目录哈希(DH)算法。它将目录视为哈希键值,实现元数据的集中存储,并采取动态负载平衡策略。通过哈希到目录并将元数据与目录粒度一起放置,它提高了大容量存储系统中元数据分发和访问的效率。 DH算法解决了文件哈希算法中存在的可伸缩性问题,例如更改目录名称或权限,从群集中添加或删除MDS等等。 DH算法可减少可扩展操作中的额外请求量和每个数据迁移的规模。它显着提高了大容量存储系统的可伸缩性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号