HBA DISTRIBUTED METADATA MANAGEMENT FOR LARGE CLUSTER-BASED STORAGE SYSTEMS PDF

Skip to Main Content. A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. Use of this web site signifies your agreement to the terms and conditions. Personal Sign In. For IEEE to continue sending you helpful information on our products and services, please consent to our updated Privacy Policy. Email Address.

Author:Kazrashura Tulkree
Country:Thailand
Language:English (Spanish)
Genre:Spiritual
Published (Last):16 June 2006
Pages:126
PDF File Size:20.86 Mb
ePub File Size:1.7 Mb
ISBN:322-5-52651-473-7
Downloads:84402
Price:Free* [*Free Regsitration Required]
Uploader:Tygozilkree



Skip to Main Content. A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. Use of this web site signifies your agreement to the terms and conditions. Personal Sign In. For IEEE to continue sending you helpful information on our products and services, please consent to our updated Privacy Policy. Email Address.

Sign In. HBA: Distributed Metadata Management for Large Cluster-Based Storage Systems Abstract: An efficient and distributed scheme for file mapping or file lookup is critical in decentralizing metadata management within a group of metadata servers. This paper presents a novel technique called Hierarchical Bloom Filter Arrays HBA to map filenames to the metadata servers holding their metadata.

Two levels of probabilistic arrays, namely, the Bloom filter arrays with different levels of accuracies, are used on each metadata server.

One array, with lower accuracy and representing the distribution of the entire metadata, trades accuracy for significantly reduced memory overhead, whereas the other array, with higher accuracy, caches partial distribution information and exploits the temporal locality of file access patterns. Both arrays are replicated to all metadata servers to support fast local lookups. We evaluate HBA through extensive trace-driven simulations and implementation in Linux.

Simulation results show our HBA design to be highly effective and efficient in improving the performance and scalability of file systems in clusters with 1, to 10, nodes or superclusters and with the amount of data in the petabyte scale or higher.

Our implementation indicates that HBA can reduce the metadata operation time of a single-metadata-server architecture by a factor of up to Article :. Date of Publication: 25 April DOI: Need Help?

APOSTILA PNEUMATOLOGIA PDF

DISTRIBUTED METADATA MANAGEMENT FOR LARGE CLUSTER-BASED STORAGE SYSTEMS

To browse Academia. Skip to main content. By using our site, you agree to our collection of information through the use of cookies. To learn more, view our Privacy Policy. Log In Sign Up.

CPEM 2011 PDF

HBA: Distributed Metadata Management for Large Cluster-Based Storage Systems

Skip to search form Skip to main content You are currently offline. Some features of the site may not work correctly. DOI: An efficient and distributed scheme for file mapping or file lookup is critical in decentralizing metadata management within a group of metadata servers. This paper presents a novel technique called Hierarchical Bloom Filter Arrays HBA to map filenames to the metadata servers holding their metadata. Two levels of probabilistic arrays, namely, the Bloom filter arrays with different levels of accuracies, are used on each metadata server. View on IEEE.

Related Articles