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

Journal of Scheduling

Volumn 4, Issue 5, 2001, Pages 245-257

  Aerts, Joep ^a,b   Korst, Jan ^a   Verhaegh, Wim ^a  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Hard disk; Load balancing; Machine eligibility; Redundant storage multiprocessor scheduling

Indexed keywords

EID: 0141684182     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.81     Document Type: Article

References (17)

1. Gemmell J, Vin HM, Kandlur DD, Rangan PV, Rowc LA. Multimedia storage servers: a tutorial. IEEE Computer 1995; 28:40-49.
2. Patterson DA, Gibson GA, Katz RH. A case for redundant arrays of inexpensive disks (raid). Proceedings of the ACM conference on management of data (SIGMOD '88), 1988; 109-116.
3. Hsiao H, DeWitt DJ. Chained declustering: a new availability strategy for multiprocessor database machines. Proceedings of Data Engineering, 1990; 456-465.
4. Merchant A, Yu PS. Analytic modeling and comparisons of striping strategies for replicated disk arrays. IEEE Transactions on Computers 1995; 44(3):419-433.
5. Papadopouli M, Golubchik L. A scalable video-on-demand server for a dynamic heterogeneous environment. In Proceedings MIS '98, Lecture Notes in Computer Science, Jajodia S, Tamer Özsu M, Dogac A (eds). Vol. 1508. Springer: Berlin, 1998; 4-17.
6. Berson S, Muntz RR, Wong WR. Randomized data allocation for real-time disk I/O. Proceedings of Compcon Conference, February 1996.
7. Muntz R, Santos JR, Berson S. A parallel disk storage system for real-time multimedia applications. International Journal of Intelligent Systems 1998; 13:1137-1174.
8. Tetzlaff W, Flynn R. Block allocation in video servers for availability and throughput. Proceedings Multimedia Computing and Networking, 1996.
9. Korst J. Random duplicated assignment: an alternative to striping in video servers. Proceedings ACM Multimedia, 1997; 219-226.
10. Aerts J, Korst J, Egner S. Random duplicate storage strategies for load balancing in multimedia servers. Information Processing Letters 2000; 76:51-59.
11. Sanders P. Asynchronous scheduling of redundant disk array. Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures, 2000; 88-98.
12. Papadimitriou CH, Steiglitz K. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall: Englewood Cliffs, NJ, 1982.
13. Aerts J, Korst J, Verhaegh W, Woeginger G. Load balancing in disk arrays: complexity of retrieval problems. IEEE Transactions on Computers, submitted.
14. Sanders P, Egner S, Korst J. Fast concurrent access to parallel disks. Proceedings of the 11th Annual ACM- SIAM Symposium on Discrete Algorithms, SODA 2000, San Francisco, January 2000; 849-858.
15. Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman: San Fransisco, 1979.
16. Lenstra JK, Shmoys DB, Tardos E. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 1990; 46:259-270.
17. Tovey CA. A simplified NP-complete satisfiability problem. Discrete Applied Mathematics 1984; 8:85-89.