A fast algorithm for online placement and reorganization of replicated data
A fast algorithm for online placement and reorganization of replicated data
复制标题
DOI：
10.1109/ipdps.2003.1213151
复制
发表时间：
2003-04
期刊：
影响因子：
--
通讯作者：
R. Honicky;E. L. Miller
中科院分区：
文献类型：
--
作者：
R. Honicky;E. L. Miller
随着存储系统扩展到数千个磁盘，数据分布和负载平衡变得越来越重要。我们提出了一个算法，分配数据对象的磁盘作为一个系统，因为它从几个磁盘增长到数百或数千。使用我们的算法的客户端可以在微秒内定位数据对象，而无需咨询中央服务器或维护对象或桶到磁盘的完整映射。尽管需要很少的全局配置数据，我们的算法是概率最优的，在均匀分布数据和最小化数据移动时，新的存储添加到系统中。此外，我们的算法支持加权分配和可变级别的对象复制，这两者都需要允许系统有效地增长，同时适应新技术。
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.