DASD dancing
- 1 May 1995
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 23 (1) , 157-166
- https://doi.org/10.1145/223587.223605
Abstract
For a video-on-demand computer system we propose a scheme which balances the load on the disks, thereby helping to solve a performance problem crucial to achieving maximal video throughput. Our load balancing scheme consists of two stages. The static stage determines good assignments of videos to groups of striped disks. The dynamic phase uses these assignments, and features a DASD dancing algorithm which performs real-time disk scheduling in an effective manner. Our scheme works synergistically with disk striping. We examine the performance of the DASD dancing algorithm via simulation experiments.Keywords
This publication has 15 references indexed in Scilit:
- RAID: high-performance, reliable secondary storageACM Computing Surveys, 1994
- A parallel hash join algorithm for managing data skewIEEE Transactions on Parallel and Distributed Systems, 1993
- Grouped sweeping scheduling for DASD-based multimedia storage managementMultimedia Systems, 1993
- Efficient storage techniques for digital continuous multimediaIEEE Transactions on Knowledge and Data Engineering, 1993
- Streaming RAIDPublished by Association for Computing Machinery (ACM) ,1993
- System architecture for a large scale video on demand serviceComputer Networks and ISDN Systems, 1991
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for OptimalityOperations Research, 1986
- The complexity of selection and ranking in X + Y and matrices with sorted columnsJournal of Computer and System Sciences, 1982
- A Fast Selection Algorithm and the Problem of Optimum Distribution of EffortJournal of the ACM, 1979
- Discrete Optimization Via Marginal AnalysisManagement Science, 1966