Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility

An important cost issue in multimedia servers is disk load balancing, such that the available hard disks are used as efficiently as possible. Disk load balancing is often done on a block basis, but can also be done on a time basis, by taking into account the actual transfer times of the blocks. In the latter approach we can also embed the disk switch times. In this paper we revisit block-based load balancing and introduce time-based load balancing. For each approach we present a mathematical model and analyse the complexity of the corresponding retrieval problem. We give algorithms with a performance bound for the NP-hard time-based retrieval problem and use simulation to compare the results of these algorithms with a maximum flow algorithm for the block-based retrieval problem. Copyright © 2001 John Wiley & Sons, Ltd.

[1]  Peter Sanders,et al.  Fast Concurrent Access to Parallel Disks , 2000, SODA '00.

[2]  William H. Tetzlaff,et al.  Block allocation in video servers for availability and throughput , 1996, Electronic Imaging.

[3]  H KatzRandy,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988 .

[4]  Maria Papadopouli,et al.  A Scable Video-on-Demand Server for a Dynamic Heterogeneous Environment , 1998, Multimedia Information Systems.

[5]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[6]  Jose Renato Santos,et al.  A parallel disk storage system for real‐time multimedia applications , 1998 .

[7]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[8]  Peter Sanders,et al.  Asynchronous scheduling of redundant disk arrays , 2000, SPAA '00.

[9]  Philip S. Yu,et al.  Analytic Modeling and Comparisons of Striping Strategies for Replicated Disk Arrays , 1995, IEEE Trans. Computers.

[10]  Nicholas Carriero,et al.  Adaptive Parallelism and Piranha , 1995, Computer.

[11]  Jose Renato Santos,et al.  A parallel disk storage system for real-time multimedia applications , 1998, Int. J. Intell. Syst..

[12]  Jan H. M. Korst,et al.  Random duplicate storage strategies for load balancing in multimedia servers , 2000, Inf. Process. Lett..

[13]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[14]  David J. DeWitt,et al.  Chained declustering: a new availability strategy for multiprocessor database machines , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[15]  Richard R. Muntz,et al.  Randomized data allocation for real-time disk I/O , 1996, COMPCON '96. Technologies for the Information Superhighway Digest of Papers.

[16]  P. Venkat Rangan,et al.  Multimedia Storage Servers: A Tutorial , 1995, Computer.

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Jan H. M. Korst.  Random duplicated assignment: an alternative to striping in video servers , 1997, MULTIMEDIA '97.

[19]  Craig A. Tovey,et al.  A simplified NP-complete satisfiability problem , 1984, Discret. Appl. Math..

[20]  Frits C. R. Spieksma,et al.  Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems , 2003, IEEE Trans. Computers.

[21]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).