Reconciling simplicity and realism in parallel disk models

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 67-76

  Sanders, Peter ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Algorithms; Experimentation; Management; Measurement; Performance; Theory; Verification

Indexed keywords

EID: 64049113175     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Micah Adler, Petra Berenbrink, Klaus Schröder, Analyzing an Infinite Parallel Job Allocation Process, Proceedings of the 6th Annual European Symposium on Algorithms, p.417-428, August 24-26, 1998
2. Joep Aerts , Jan Korst , Sebastian Egner, Random duplicate storage strategies for load balancing in multimedia servers, Information Processing Letters, v.76 n.1-2, p.51-59, Nov. 2000 [doi〉10.1016/S0020-0190(00)00115-0]
3. AERTS, J., KORST, J., AND VERHAEGH, W. Complexity of retrieval problems. Tech. Rep. NL-MS-20.899, Philips Research Laboratories, 2000.
4. Alok Aggarwal , Jeffrey,S. Vitter, The input/output complexity of sorting and related problems, Communications of the ACM, v.31 n.9, p.1116-1127, Sept. 1988 [doi〉10.1145/48529.48535]
5. BOLLOBAS, B. Random graphs. Academic Press, 1985.
6. André Brinkmann , Kay Salzwedel , Christian Scheideler, Efficient, distributed data placement strategies for storage area networks (extended abstract), Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, p.119-128, July 09-13, 2000, Bar Harbor, Maine, United States [doi〉10.1145/341800.341815]
7. DUBHASHI, D. P., AND PANCONESI, A. Concentration of measure for computer scientists. Draft Manuscript, http ://uww. brics, dk/'ale/paper s. html, February 1998.
8. Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
9. HANSEN, E. Global optimization using interval analysis - the multidimensional case. Numerische Mathematik 34 (1980), 247-270.
10. Jan Korst, Random duplicated assignment: an alternative to striping in video servers, Proceedings of the fifth ACM international conference on Multimedia, p.219-226, November 09-13, 1997, Seattle, Washington, United States [doi〉10.1145/266180.266372]
11. LEISERSON, C. E. Fat trees: Universal networks for hardware efficient supercomputing. In International Conference on Parallel Processing (1985), pp. 393-402.
12. J. K. Lenstra , D. B. Shmoys , É. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming: Series A and B, v.46 n.3, p.259-271, Apr. 1990 [doi〉10.1007/BF01585745]
13. MCDIARMID, C. Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics, M. Habib, C. McDiarmid, and J. Ramirez-Alfonsin, Eds. Springer, 1998, pp. 195-247.
14. Michael David Mitzenmacher , Alistair Sinclair, The power of two choices in randomized load balancing, 1996
15. MITZENMACHER, M., RICHA, A., AND SITARAMAN, R. The power of two random choices: A survey of the techniques and results. In Handbook of Randomized Computing, P. Pardalos, S. Rajasekaran, and J. Rolim, Eds. Kluwer, 2000.
16. Boris Pittel , Joel Spencer , Nicholas Wormald, Sudden emergence of a giant k-core in a random graph, Journal of Combinatorial Theory Series B, v.67 n.1, p.111-151, May 1996 [doi〉10.1006/jctb.1996.0036 ]
17. Prabhakar Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Journal of Computer and System Sciences, v.37 n.2, p.130-143, October 1988 [doi>10.1016/0022-0000(88) 90003-7]
18. Peter Sanders, Asynchronous scheduling of redundant disk arrays, Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, p.89-98, July 09-13, 2000, Bar Harbor, Maine, United States [doi〉10.1145/341800.341812]
19. Peter Sanders , Sebastian Egner , Jan Korst, Fast concurrent access to parallel disks, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.849-858, January 09-11, 2000, San Francisco, California, United States
20. L. A.M. Schoenmakers, A new algorithm for the recognition of series parallel graphs, CWI (Centre for Mathematics and Computer Science), Amsterdam, The Netherlands, 1995
21. TOVEY, C. A. A simplified NP-complete satisfiability problem. Discrete Applied Mathematics 8 (1984), 85- 89.
22. Jeffrey Scott Vitter, External Memory Algorithms, Proceedings of the 6th Annual European Symposium on Algorithms, p.1-25, August 24-26, 1998
23. VITTER, J. S., AND SHRIVER, E. A. M. Algorithms for parallel memory I: Two level memories. Algorithmica 12, 2-3 (1994), 110-147.
24. Berthold Vöcking, How Asymmetry Helps Load Balancing, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.131, October 17-18, 1999
25. VVEDENSKAYA, N. D., DOBRUSHIN, R. L., AND KARPELEVICH, F. I. Queueing system with selection of the shortest of two queues: An asymptotic approach. Problems of Information Transmission 32, 1 (1996), 15-29.