A Fast Algorithm for Online Placement and Reorganization of Replicated Data

As storage systems scale to thousands of disks, data distribution and load balancing become increasingly important. We present an algorithm for allocating data objects to disks as a system as it grows from a few disks to hundreds or thousands. A client using our algorithm can locate a data object in microseconds without consulting a central server or maintaining a full mapping of objects or buckets to disks. Despite requiring little global configuration data, our algorithm is probabilistically optimal in both distributing data evenly and minimizing data movement when new storage is added to the system. Moreover, our algorithm supports weighted allocation and variable levels of object replication, both of which are needed to permit systems to efficiently grow while accommodating new technology.

• Type: Conference
• Year: 2003
• Where: IPPS
• Authors: R. J. Honicky, Ethan L. Miller
• Keywords: Algorithm, Data Distribution, Data Object, Distributed And Parallel Computing, IPPS 2003