首页> 外文会议>International Parallel and Distributed Processing Symposium >A Fast Algorithm for Online Placement and Reorganization of Replicated Data
【24h】

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.
机译:作为存储系统缩放到数千个磁盘,数据分布和负载平衡变得越来越重要。我们提出了一种将数据对象分配给磁盘作为系统的算法,因为它从几个磁盘到数百或数千块。使用我们的算法的客户端可以在微秒内定位数据对象,而无需咨询中央服务器或维护对象或存储桶的完全映射到磁盘。尽管需要很少的全局配置数据,但在将新存储添加到系统时,我们的算法在分发数据中均可均匀并最小化数据移动。此外,我们的算法支持对象复制的加权分配和可变级别,这两者都需要允许系统在适应新技术的同时有效地增长。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号