This Article 
 Bibliographic References 
 Add to: 
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems
September 2003 (vol. 52 no. 9)
pp. 1210-1214

Abstract—Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classification of retrieval problems for random redundant storage.

[1] J. Aerts, J. Korst, and S. Egner, Random Duplicate Storage for Load Balancing in Multimedia Servers Information Processing Letters, vol. 76, nos. 1-2, pp. 51-59, 2000.
[2] J. Aerts, J. Korst, F. Spieksma, W. Verhaegh, and G. Woeginger, Load Balancing in Disk Arrays: Complexity of Retrieval Problems Technical Report NL-TN 2002-271, Philips Research Eindhoven, 2002.
[3] J. Aerts, J. Korst, and W. Verhaegh, Load Balancing for Redundant Storage Strategies: Multiprocessor Scheduling with Machine Eligibility J. Scheduling, vol. 4, no. 5, pp. 245-257, 2001.
[4] J. Aerts, J. Korst, and W. Verhaegh, Improving Disk Efficiency in Video Servers by Random Redundant Storage Proc. Conf. Internet and Multimedia Systems and Applications (IMSA '02), pp. 354-359, 2002.
[5] P. Berenbrink, A. Brinkmann, and C. Scheideler, Design of the PRESTO Multimedia Storage Network Proc. Int'l Workshop Comm. and Data Management in Large Networks (CDMLarge '99), 1999.
[6] P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking, Balanced Allocations: The Heavily Loaded Case Proc. 32th Ann. ACM Symp. Theory of Computing, pp. 745-754, 2000.
[7] S. Berson, S. Ghandeharizadeh, R.R. Muntz, and X. Ju, “Staggered Striping in Multimedia Information Systems,” Proc. SIGMOD, 1994.
[8] M. Buddhikot and G. Parulkar, Efficient Data Layout, Scheduling and Playout Control in MARS Proc. ACM Multimedia, pp. 199-212, 1997.
[9] T.S. Chua, J. Li, B.C. Ooi, and K.-L. Tan, Disk Striping Strategies for Large Video-on-Demand Servers Proc. ACM Multimedia, pp. 297-306, 1996.
[10] E. Dinic, Algorithm for Solution of a Problem of a Maximal Flow in a Network with Power Estimation Soviet Math. Doklady, vol. 11, pp. 1277-1280, 1970.
[11] G. Gallo, M.D. Grigoriadis, and R.E. Tarjan, A Fast Parametric Maximum Flow Algorithm and Applications SIAM J. Computing, vol. 18, no. 1, pp. 30-55, 1989.
[12] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[13] D.J. Gemmell et al., "Multimedia Storage Servers: A Tutorial," Computer, May 1995, pp. 40-49.
[14] A. Goldberg and R. Tarjan, "A New Approach to the Maximum Flow Problem," J. ACM, vol. 35, pp. :921-940, 1988.
[15] J. Korst, Random Duplicate Assignment: An Alternative to Striping in Video Servers Proc. ACM Multimedia, pp. 219-226, 1997.
[16] J. Korst, V. Pronk, P. Coumans, G. van Doren, and E. Aarts, Comparing Disk Scheduling Algorithms for VBR Data Streams Computer Comm., vol. 21, pp. 1328-1343, 1998.
[17] S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementation. John Wiley and Sons, 1990.
[18] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[19] M. Pinedo, Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 1995.
[20] C. Ruemmler and J. Wilkes, "An Introduction to Disk Drive Modeling," Computer, vol. 27, no. 3, pp. 17-28, Mar. 1994.
[21] P. Sanders, Asynchronous Scheduling for Redundant Disk Arrays Proc. ACM Symp. Parallel Algorithms and Architectures (SPAA '00), pp. 98-108, 2000.
[22] P. Sanders, Reconciling Simplicity and Realism in Parallel Disk Models Proc. 12th ACM-SIAM Symp. Discrete Algorithms, pp. 67-76, 2001.
[23] P. Sanders, S. Egner, and J. Korst, Fast Concurrent Access to Parallel Disks Proc. 11th ACM-SIAM Symp. Discrete Algorithms, pp. 849-858, 2000.
[24] J.R. Santos and R.R. Muntz, "Performance Analysis of the RIO Multimedia Storage System with Heterogeneous Disk Configurations," Proc. 6th ACM Int'l Multimedia Conference (ACM MM 98), ACM Press, New York, 1998, pp. 303-308.
[25] J. Santos, R. Muntz, and B. Ribeiro-Neto, “Comparing Random Data Allocation and Data Stripping in Multimedia Servers,” Proc. ACM SIGMETRICS Conf., June 2000.

Index Terms:
Random redundant storage, load balancing, video servers, complexity analysis.
Joep Aerts, Jan Korst, Frits Spieksma, Wim Verhaegh, Gerhard Woeginger, "Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems," IEEE Transactions on Computers, vol. 52, no. 9, pp. 1210-1214, Sept. 2003, doi:10.1109/TC.2003.1228515
Usage of this product signifies your acceptance of the Terms of Use.