Implementation and Analysis of the File System Based on Metadata Dynamic Hashing

Article Preview

Abstract:

Metadata management algorithm plays an important role in file system performance and file system is the most common way of data accessing in mass storage systems, so metadata management algorithm is very important for the performance of mass storage system. In this paper we analyze current metadata management algorithms and bring in the metadata dynamic hashing algorithm to solve the problem of poor adaptability of them. We realize the prototype on Lustre. After testing system performance with common tools by adjusting the several parameters’ value of metadata dynamic hashing algorithm, we find that performance of the prototype I/O is superior to Lustre. Furthermore, we analyze impacts of the parameters of dynamic hashing function on I/O performance of prototype

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 490-495)

Pages:

1034-1038

Citation:

Online since:

March 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Lustre file system white paper, Oct. (2008).

Google Scholar

[2] Brandt S A, Lan Xue, Miller E L, et al. Efficient metadata management in large distributed file systems: Proceedings of the 20th IEEE / 11th NASA Goddard Conference on Mass Storage System and Technologies[C]. San Diego: [s. n. ], 2003: 290-297.

DOI: 10.1109/mass.2003.1194865

Google Scholar

[3] S.A. Weil, K.T. Pollack, S.A. Brandt, and E.L. Miller. Dynamic Metadata Management for Petabyte-Scale File System. Proc. ACM/IEEE Conf. Supercomputing(SC' 04), p.4, (2004).

DOI: 10.1109/sc.2004.22

Google Scholar

[4] Liu Zhong, Zhang Wensong, Wang Zhaofu, Zhou Xingming. Design of a Cluster Storage System Based on OSD. COMPUTER ENGINEERING AND SCIENCE. No. 2, (2005).

Google Scholar

[5] Corbett P F, Feitelso D G. The Vesta parallel file system[J]. ACM Trans. on Computer System, 1996, 14(3): 225-264.

DOI: 10.1145/233557.233558

Google Scholar

[6] Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, and H. Raymond Strong. Extendible hashing—a fast access method for dynamic files. ACM Transactions on Database Systems , TODS Homepage, Sept. (1979).

DOI: 10.1145/320083.320092

Google Scholar

[7] P. -Å. Larson, Dynamic hash tables, Communications of the ACM, 31, (4), (1988).

Google Scholar

[8] William G. Griswold, Gregg M. Townsend. The Design and Implementation of Dynamic Hashing for Sets and Tables in Icon. SOFTWARE-PRACTICE AND EXPERIENCE, 1993, 23(4): 351-367.

DOI: 10.1002/spe.4380230402

Google Scholar