By Topic

Metadata Partitioning for Large-Scale Distributed Storage Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jan-Jan Wu ; Res. Center for Inf. Technol. Innovation, Acad. Sinica, Taipei, Taiwan ; Pangfeng Liu ; Yi-Chien Chung

With the emergence of large-scale storage systems that separate metadata management from file read/write operations, and with requests targetting metadata account for over 80% of the total number of I/O requests, metadata management has become an interesting research problem on its own. When designing a metadata server cluster, the partitioning of the metadata among the servers is of critical importance for maintaining efficient metadata operations and balanced load distribution across the cluster. We propose a dynamic programming method combined with binary search to solve the partitioning problem. With theoretical analysis and extensive experiments, we show that our algorithm finds the partitioning that minimizes load imbalance among servers and maximize efficiency of metadata operations.

Published in:

2010 IEEE 3rd International Conference on Cloud Computing

Date of Conference:

5-10 July 2010