1. Smash: Flexible, Fast, and Resource-efficient Placement and Lookup of Distributed Storage
- Author
-
Yi Liu, Shouqian Shi, Minghao Xie, Heiner Litz, and Chen Qian
- Subjects
Computer Networks and Communications ,Hardware and Architecture ,Computer Science (miscellaneous) ,Safety, Risk, Reliability and Quality - Abstract
Large-scale distributed storage systems, such as object stores, usually apply hashing-based placement and lookup methods to achieve scalability and resource efficiency. However, when object locations are determined by hash values, placement becomes inflexible, failing to optimize or satisfy application requirements such as load balance, failure tolerance, parallelism, and network/system performance. This work presents a novel solution to achieve the best of two worlds: flexibility while maintaining cost-effectiveness and scalability. The proposed method Smash is an object placement and lookup method that achieves full placement flexibility, balanced load, low resource cost, and short latency. Smash utilizes a recent space-efficient data structure and applies it to object-location lookups. We implement Smash as a prototype system and evaluate it in a public cloud. The analysis and experimental results show that Smash achieves full placement flexibility, fast storage operations, fast recovery from node dynamics, and lower DRAM cost (
- Published
- 2023