Share Email Print
cover

Proceedings Paper

Metadata distribution algorithm based on directory hash in mass storage system
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

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.

Paper Details

Date Published: 20 March 2009
PDF: 5 pages
Proc. SPIE 7125, Eighth International Symposium on Optical Storage and 2008 International Workshop on Information Data Storage, 71251Q (20 March 2009); doi: 10.1117/12.822635
Show Author Affiliations
Wei Wu, Wuhan National Lab. for Optoelectronics, Huazhong Univ. of Science and Technology (China)
Dong-jian Luo, Wuhan National Lab. for Optoelectronics, Huazhong Univ. of Science and Technology (China)
Can-hao Pei, Wuhan National Lab. for Optoelectronics, Huazhong Univ. of Science and Technology (China)


Published in SPIE Proceedings Vol. 7125:
Eighth International Symposium on Optical Storage and 2008 International Workshop on Information Data Storage
Fuxi Gan, Editor(s)

© SPIE. Terms of Use
Back to Top