The Community for Technology Leaders
Proceedings 18th International Conference on Data Engineering (2002)
San Jose, California
Feb. 26, 2002 to Mar. 1, 2002
ISBN: 0-7695-1531-2
pp: 0473
Ashish Goel , University of Southern California
Cyrus Shahabi , University of Southern California
Shu-Yuen Didi Yao , University of Southern California
Roger Zimmermann , University of Southern California
ABSTRACT
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.
INDEX TERMS
continuous media server, scalable disks, random placement
CITATION
Ashish Goel, Cyrus Shahabi, Shu-Yuen Didi Yao, Roger Zimmermann, "SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks", Proceedings 18th International Conference on Data Engineering, vol. 00, no. , pp. 0473, 2002, doi:10.1109/ICDE.2002.994760
92 ms
(Ver 3.3 (11022016))