Skip to main content
Open Access Publications from the University of California

Random slicing: Efficient and scalable data placement for large-scale storage systems

  • Author(s): Miranda, A
  • Effert, S
  • Kang, Y
  • Miller, EL
  • Popov, I
  • Brinkmann, A
  • Friedetzky, T
  • Cortes, T
  • et al.

Published Web Location

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. © 2014 ACM.

Many UC-authored scholarly publications are freely available on this site because of the UC Academic Senate's Open Access Policy. Let us know how this access is important for you.

Main Content
Current View