Self-adjusting binary search trees
Journal of the ACM (JACM)
RIO: a real-time multimedia object server
ACM SIGMETRICS Performance Evaluation Review - Special issue on multimedia storage systems
Comparing random data allocation and data striping in multimedia servers
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Efficient, distributed data placement strategies for storage area networks (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
On algorithms for efficient data migration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
Algorithms for data migration with cloning
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
SLAS: An efficient approach to scaling round-robin striped volumes
ACM Transactions on Storage (TOS)
Automated control for elastic storage
Proceedings of the 7th international conference on Autonomic computing
FDTM: block level data migration policy in tiered storage system
NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
FastScale: accelerate RAID scaling by minimizing data migration
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Design and Evaluation of a New Approach to RAID-0 Scaling
ACM Transactions on Storage (TOS)
CRAID: online RAID upgrades using dynamic hot data reorganization
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
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.