Yima: real-time multimedia storage and retrieval
Proceedings of the tenth ACM international conference on Multimedia
Hash-based labeling techniques for storage scaling
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient disk replacement and data migration algorithms for large disk subsystems
ACM Transactions on Storage (TOS)
Scalability evaluation of the Yima streaming media architecture
Software—Practice & Experience
Increasing the capacity of RAID5 by online gradual assimilation
SNAPI '04 Proceedings of the international workshop on Storage network architecture and parallel I/Os
CRUSH: controlled, scalable, decentralized placement of replicated data
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
SLAS: An efficient approach to scaling round-robin striped volumes
ACM Transactions on Storage (TOS)
Adaptive data block placement based on deterministic zones (adaptiveZ)
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
FastScale: accelerate RAID scaling by minimizing data migration
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Randomized data allocation in scalable streaming architectures
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
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 |
Scalable storage architectures allow for the addition of disks to increase storage capacity and/or bandwidth. In its general form, disk scaling also refers to disk removals when either capacity needs to be conserved or old disk drives are retired. Assuming random placement of blocks on multiple nodes of a continuous media server, our optimization objective is to redistribute a minimum number of media blocks after disk scaling. This objective should be met under two restrictions. First, uniform distribution and hence a balanced load should be ensured after redistribution. Second, the redistributed blocks should be retrieved at the normal mode of operation in one disk access and through low complexity computation. We propose a technique that meets the objective, while we prove that it also satisfies both restrictions. The SCADDAR approach is based on using a series of Remap functions which can derive the location of a new block using only its original location as a basis.