Skip to main content

Research Repository

Advanced Search

Random Slicing: Efficient and Scalable Data Placement for Large-Scale Storage Systems

Miranda, Alberto; Effert, Sascha; Kang, Yangwook; Miller, Ethan L.; Popov, Ivan; Brinkmann, Andre; Friedetzky, Tom; Cortes, Toni

Random Slicing: Efficient and Scalable Data Placement for Large-Scale Storage Systems Thumbnail


Authors

Alberto Miranda

Sascha Effert

Yangwook Kang

Ethan L. Miller

Ivan Popov

Andre Brinkmann

Toni Cortes



Abstract

The ever-growing amount of data requires highly scalable storage solutions. The most flexible approach is to use storage pools that can be expanded and scaled down by adding or removing storage devices. To make this approach usable, it is necessary to provide a solution to locate data items in such a dynamic environment. This article presents and evaluates the Random Slicing strategy, which incorporates lessons learned from table-based, rule-based, and pseudo-randomized hashing strategies and is able to provide a simple and efficient strategy that scales up to handle exascale data. Random Slicing keeps a small table with information about previous storage system insert and remove operations, drastically reducing the required amount of randomness while delivering a perfect load distribution.

Citation

Miranda, A., Effert, S., Kang, Y., Miller, E. L., Popov, I., Brinkmann, A., …Cortes, T. (2014). Random Slicing: Efficient and Scalable Data Placement for Large-Scale Storage Systems. Transactions on Storage, 10(3), Article 9. https://doi.org/10.1145/2632230

Journal Article Type Article
Acceptance Date Sep 1, 2013
Publication Date Jul 1, 2014
Deposit Date Dec 16, 2015
Publicly Available Date Mar 29, 2024
Journal Transactions on Storage
Print ISSN 1553-3077
Publisher Association for Computing Machinery (ACM)
Peer Reviewed Peer Reviewed
Volume 10
Issue 3
Article Number 9
DOI https://doi.org/10.1145/2632230

Files

Accepted Journal Article (1.1 Mb)
PDF

Copyright Statement
© 2014 ACM. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Storage (TOS), Volume 10, Issue 3, July 2014
Article No. 9, http://doi.acm.org/10.1145/10.1145/2632230





You might also like



Downloadable Citations