Fast concurrent access to parallel disks

Algorithmica (New York)

Volumn 35, Issue 1, 2003, Pages 21-55

  Sanders, Peter ^a   Egner, Sebastian ^b   Korst, Jan ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

External memory; Load balancing; Randomized algorithm; Scheduling

Indexed keywords

COMPUTER SIMULATION; DATA STRUCTURES; INFORMATION RETRIEVAL SYSTEMS; MAGNETIC DISK STORAGE; PROBABILITY; REDUNDANCY; RESOURCE ALLOCATION; STORAGE ALLOCATION (COMPUTER);

EXTERNAL MEMORY; LOAD BALANCING; PARALLEL DISKS; RANDOMIZED ALGORITHM;

ALGORITHMS;

EID: 0942290209     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-0987-0     Document Type: Article

References (50)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
2. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory, I: two level memories. Algorithmica, 12(2-3):110-147, 1994.
3. J. S. Vitter. External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys, 33(2):209-271, June 2001.
4. D. P. Dubhashi and D. Ranjan. Balls and bins: a study in negative dependence. RSA: Random Structures & Algorithms, 13:99-124, 1998.
5. P. Sanders. Reconciling simplicity and realism in parallel disk models. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 67-76, 2001.
6. P. Sanders. Reconciling simplicity and realism in parallel disk models. Parallel Computing, 28(5):705-723, 2002. Special Issue on Parallel Data Intensive Algorithms and Applications.
7. K. Salem and H. Garcia-Molina. Disk striping. In Proceedings of Data Engineering '86, pages 336-342, 1986.
8. D. Patterson, G. Gibson, and R. Katz. A case for redundant arrays of inexpensive disks (RAID). Proceedings of ACM SIGMOD '88, pages 109-116, 1988.
9. J. Korst. Random duplicate assignment: an alternative to striping in video servers. In Proceedings of ACM Multimedia, pages 219-226, 1997.
10. R. D. Barve, E. F. Grove, and J. S. Vitter. Simple randomized mergesort on parallel disks. Parallel Computing, 23(4):601-631, 1997.
11. J. S. Vitter and D. A. Hutchinson. Distribution sort with randomized cycling. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 77-86, 2001.
12. D. A. Hutchinson, P. Sanders, and J. S. Vitter. Duality between prefetching and queued writing with parallel disks. In Proceedings of the 9th European Symposium on Algorithms (ESA), number 2161 in LNCS, pages 62-73. Springer-Verlag, Berlin, 2001.
13. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. In Proceedings of the 26th ACM Symposium on the Theory of Computing, pages 593-602, 1994.
14. P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking. Balanced allocations: the heavily loaded case. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 745-754, 2000.
15. B. Vöcking. How asymmetry helps load balancing. In Proceedings of the 40th Symposium on Foundations of Computer Science, pages 131-140, 1999.
16. R. M. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM simulation on a distributed memory machine. In Proceedings of the 24th ACM Symposium on Theory of Computing, pages 318-326, May 1992.
17. M. Dietzfelbinger and F. Meyer auf der Heide. Simple, efficient shared memory simulations. In Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures, pages 110-119, 1993.
18. F. Meyer auf der Heide, C. Scheideler, and V. Stemann. Exploiting storage redundancy to speed up randomized shared memory simulations. Theoretical Computer Science, 162(2):245-281, August 1996.
19. R. Muntz, J. R. Santos, and S. Berson. A parallel disk storage system for real-time multimedia applications. International Journal of Intelligent Systems, 13:1137-1174, 1998.
20. W. Tetzlaff and R. Flynn. Block allocation in video servers for availability and throughput. Proceedings, Multimedia Computing and Networking, 1996. www.cs.utexas.edu/users/mmcn/96/proceedings.html.
21. R. Tewari, R. Mukherjee, D. M. Dias, and H. M. Vin. Design and performance tradeoffs in clustered video servers. Proceedings of the International Conference on Multimedia Computing and Systems, pages 144-150, 1996.
22. S. Berson, R. R. Muntz, and W. R. Wong. Randomized data allocation for real-time disk I/O. Proceedings of the 41st IEEE Computer Society Conference, COMPCON '96, pages 286-290, 1996.
23. Y. Birk. Random RAIDs with selective exploitation of redundancy for high performance video servers. Proceedings of NOSSDAV '97, pages 13-23, 1997.
24. P. Sanders. Asynchronous scheduling of redundant disk arrays. In Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures, pages 89-98, 2000.
25. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamasia, D. E. Vengroff, and J. S. Vitter. External memory graph algorithms. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-149, 1995.
26. J. Sibeyn and M. Kaufmann. BSP-like external-memory computation. In Proceedings of the 3rd Italian Conference on Algorithms and Complexity, pages 229-240, 1997.
27. F. Dehne, W. Dittrich, and D. Hutchinson. Efficient external memory algorithms by simulating coarse-grained parallel algorithms. In Proceedings of the ACM Symposium on Parallel Architectures and Algorithms, pages 106-115, 1997.
28. F. Dehne, W. Dittrich, D. Hutchinson, and A. Maheshwari. Reducing i/o complexity by simulating coarse grained parallel algorithms. In Proceedings of the 13th International Parallel Processing Symposium, pages 14-20, 1999.
29. A. Papoulis. Probability, Random Variables, and Stochastic Processes, 2nd edn. McGraw-Hill, New York, 1984.
30. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, Reading, MA, 1989.
31. L. A. M. Schoenmakers. A new algorithm for the recognition of series parallel graphs. Technical Report CS-R9504, CWI - Centrum voor Wiskunde en Informatica, January 31, 1995.
32. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C, 2nd edn. Cambridge University Press, Cambridge, 1992.
33. C. McDiarmid. Concentration. In M. Habib, C. McDiarmid, and J. Ramirez-Alfonsin, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, pages 195-247. Springer-Verlag, New York, 1998.
34. T. Worsch. Lower and upper bounds for (sums of) binomial coefficients. Technical Report IB 31/94, Universität Karlsruhe, 1994.
35. D. P. Dubhashi and A. Panconesi. Concentration of measure for computer scientists. Draft manuscript, http://www.brics.dk/~ale/papers.html, February 1998.
36. S. Even and E. Tarjan. Network flow and testing graph connectivity. SIAM Journal on Computing, 4:507-518, 1975.
37. E. A. Dinic (now spelled "Dinitz"). Algorithm for solution of a problem of maximum flow. Soviet Mathematics. Doklady, 11:1277-1280, 1970.
38. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill, New York, 1990.
39. R. K. Ahuja, R. L. Magnanti, and J. B. Orlin. Network Flows. Prentice-Hall, Englewood Cliffs, NJ, 1993.
40. Y. Azar, A. Z. Broder, A. R. Karlin, and Eli Upfal. Balanced allocations. SIAM Journal on Computing, 29(1):180-200, February 2000.
41. A. Czumaj and V. Stemann. Randomized allocation processes. In Proceedings of the 38th Symposium on Foundations of Computer Science (FOCS), pages 194-203, 1997.
42. B. Pittel, J. Spencer, and N. Wormald. Sudden emergence of a giant k-core in random graph. Journal of Combinatorial Theory, Series B, 67, 111-151, 1996.
43. F. J. MacWilliams and N. J. A. Sloane. Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1988.
44. G. A. Gibson, L. Hellerstein, R. M. Karp, R. H. Katz, and D. A. Patterson. Coding techniques for handling failures in large disk arrays, csd-88-477. Technical Report, University of California, Berkley, 1988.
45. D. E. Knuth. The Art of Computer Programming-Sorting and Searching, volume 3, 2nd edn., Addison-Wesley, Reading, MA, 1998.
46. M. H. Nodine and J. S. Vitter. Greed sort: an optimal sorting algorithm for multiple disks. Journal of the ACM, 42(4):919-933, 1995.
47. P. Sanders, S. Egner, and J. Korst. Fast concurrent access to parallel disks. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pages 849-858, 2000.
48. L. Arge. The buffer tree: a new technique for optimal I/O-algorithms. In Proceedings of the 4th Workshop on Algorithms and Data Structures, number 955 in LNCS, pages 334-345. Springer-Verlag, Berlin, 1995.
49. P. Sanders. Fast priority queues for cached memory. In ALENEX '99, Workshop on Algorithm Engineering and Experimentation, number 1619 in LNCS, pages 312-327. Springer-Verlag, Berlin, 1999.
50. L. Tolhuizen. On maximum distance separable codes over alphabets of arbitrary size. In Proceedings of the IEEE International Symposium on Information Theory, page 431, 1994.