A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Compact, adaptive placement schemes for non-uniform requirements
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
CRUSH: controlled, scalable, decentralized placement of replicated data
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Dynamic and Redundant Data Placement
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
The continued exponential increase in stored data as well as the high demand for I/O performance is imposing high pressure on the scalability properties of storage environments. The resulting number of disk drives in huge environments does not only lead to management, but also to reliability problems. The foundations of scalable and reliable storage systems are data distribution algorithms, which are able to scale performance and capacity based on the number of disk drives and which are able to efficiently support multi-error correcting codes. In this paper, we propose data distribution strategies, which are competitive concerning the number of data movements required to optimally adapt to a changing number of heterogeneous disk drives under these constraints.