Affiliation:
1. University of Southern California, Los Angeles, CA
Abstract
Random data placement, which is efficient and scalable for large-scale storage systems, has recently emerged as an alternative to traditional data striping. In this report, we study the
disk replacement problem
(DRP) to find a sequence of disk additions and removals for a storage system, while migrating the data and respecting the following constraints: (1) the data is initially balanced across the existing distributed disk configuration, (2) the data must again be balanced across the new configuration, and (3) the data migration cost must be minimized. In practice, migrating data from old disks to new devices is complicated by the fact that the total number of disks connected to the storage system is often limited by a fixed number of available slots and not all the old and new disks can be connected at the same time. This article presents solutions for both cases where the number of disk slots is either unconstrained or constrained.
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture
Reference10 articles.
1. Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduction to Algorithms 2nd ed. The MIT Press.]] Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduction to Algorithms 2nd ed. The MIT Press.]]
2. Hall J. Hartline J. Karlin A. R. Saia J. and Wilkes J. 2001. On algorithms for efficient data migration. In the 12th annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Washington DC.]] Hall J. Hartline J. Karlin A. R. Saia J. and Wilkes J. 2001. On algorithms for efficient data migration. In the 12th annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Washington DC.]]
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献