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
Data replication in p2p environments
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Proceedings of the 4th ACM international workshop on Storage security and survivability
Distributing Orthogonal Redundancy on Adaptive Disk Arrays
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Redundant Data Placement Strategies for Cluster Storage Environments
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
RSEDP: an effective hybrid data placement algorithm for large-scale storage systems
The Journal of Supercomputing
Direct lookup and hash-based metadata placement for local file systems
Proceedings of the 6th International Systems and Storage Conference
| Hi-index | 0.00 |
We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efjTcient adaptation to a changing set of devices.