1- https://doi.org/10.1007/978-981-13-2721-6_2
Hashing Computation for Scalable Metadata
- Jan 1, 2019
- Yu Hua +1 more
This section presents a scalable and adaptive decentralized metadata lookup scheme for ultra large-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 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 ultra large-scale storage systems (©{2011}IEEE. Reprinted, with permission, from Ref. [1].).
- # Metadata Servers
- # Implementation In Linux
- # Query Efficiency
- # Memory Speed
- # Prototype Implementation
- # Large-scale Systems
- # Metadata Query
- # Multilayered Hierarchy
- # Scalability In Systems
- # Network Speed
