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 paper 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.
CitationMiranda, A. [et al.]. Reliable and randomized data distribution strategies for large scale storage systems. A: International Conference on High Performance Computing. "18th International Conference on High Performance Computing, HiPC 2011". 2011, p. 1-10.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org