Supporting Scalable and Adaptive Metadata Management in Ultralarge-Scale File Systems

被引:26
作者
Hua, Yu [1 ]
Zhu, Yifeng [2 ]
Jiang, Hong [3 ]
Feng, Dan [1 ]
Tian, Lei [1 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Peoples R China
[2] Univ Maine, Dept Elect & Comp Engn, Orono, ME 04469 USA
[3] Univ Nebraska, Dept Comp Sci & Engn, Lincoln, NE 68588 USA
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
File systems; Bloom filters; metadata management; scalability; performance evaluation;
D O I
10.1109/TPDS.2010.116
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents a scalable and adaptive decentralized metadata lookup scheme for ultralarge-scale file systems (more than Petabytes or even Exabytes). Our scheme logically organizes metadata servers (MDSs) into a multilayered query hierarchy and exploits grouped Bloom filters to efficiently route metadata requests to desired MDSs through the hierarchy. This metadata lookup scheme can be executed at the network or memory speed, without being bounded by the performance of slow disks. An effective workload balance method is also developed in this paper for server reconfigurations. This scheme is evaluated through extensive trace-driven simulations and a prototype implementation in Linux. Experimental results show that this scheme can significantly improve metadata management scalability and query efficiency in ultralarge-scale storage systems.
引用
收藏
页码:580 / 593
页数:14
相关论文
共 49 条
[1]  
Adya A, 2002, USENIX ASSOCIATION PROCEEDINGS OF THE FIFTH SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, P1
[2]   Serverless network file systems [J].
Anderson, TE ;
Dahlin, MD ;
Neefe, JM ;
Patterson, DA ;
Roselli, DS ;
Wang, RY .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1996, 14 (01) :41-79
[3]  
[Anonymous], 2006, P 7 S OP SYST DES IM
[4]   Towards an object store [J].
Azagury, A ;
Dreizin, V ;
Factor, M ;
Henis, E ;
Naor, D ;
Satran, J ;
Tavory, A ;
Yerushalmi, L ;
Rinetzky, N ;
Rodeh, O .
20TH IEEE/11TH NASA GODDARD CONFERENCE ON MASS STORAGE AND TECHNOLOGIES (MSST 2003), PROCEEDINGS, 2003, :165-176
[5]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[6]   Beyond bloom filters: From approximate membership checks to approximate state machines [J].
Bonomi, Flavio ;
Mitzenmacher, Michael ;
Panigrahy, Rina ;
Singh, Sushil ;
Varghese, George .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (04) :315-326
[7]  
BRAAM PJ, 2005, LUSTRE WHITEPAPER
[8]  
BRAAM PJ, 1999, P LIN EXP
[9]  
BRANDT SA, 2003, P 20 IEEE NASA GODD
[10]  
Broder Andrei, 2002, Internet mathematics, P636, DOI DOI 10.1080/15427951.2004.10129096