Competitive implementation of parallel programs

Algorithmica (New York)

Volumn 23, Issue 1, 1999, Pages 14-30

  Deng, X ^a   Koutsoupias, E ^b   Mackenzie, P ^c  

^a YORK UNIVERSITY   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c BOISE STATE UNIVERSITY   (United States)

Author keywords

Communication delay; Competitive analysis; Compiler; Parallel computation; Scheduling

Indexed keywords

EID: 0039011702     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009248     Document Type: Article

References (16)

1. N. Alon, J. H. Spencer, and P. Erdös. The Probabilistic Method. Wiley, New York, 1992.
2. D. E. Culler, R. M. Karp, D. Patterson, A. Sahay, E. E. Santos, K. E. Schauser, R. Subramonian and T. von Eicken. LogP: a practical model of parallel computation. Communications of the ACM, 39(11):78-85, November 1996.
3. R. P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51(1):161-166, 1950.
4. R. L. Graham. Bounds for certain multiprocessor timing anomalies. Bell System Technical Journal, 45:1563-1581, 1966.
5. H. Jung, L. M. Kirousis, and P. Spirakis. Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays. Information and Computation, 105(1):94-104, July 1993.
6. A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79-119, 1988.
7. W. Loewe and W. Zimmermann. Upper time bounds for executing PRAM-programs on the LogP-machine. In Proceedings of the 9th ACM International Conference on Supercomputing, pages 41-50, 1995.
8. M. Manasse, L. A. McGeoch, and D. Sleator. Competitive algorithms for server problems. Journal of Algorithms, 11:208-230, 1990.
9. R. Motwani, S. Phillips, and E. Torng. Nonclairvoyant scheduling. Theoretical Computer Science, 13(1):17-47, 1994.
10. C. H. Papadimitriou and J. D. Ullman. A communication-time tradeoff. SIAM Journal on Computing, 16(4):639-646, August 1987.
11. C. H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19(2):322-328, 1990.
12. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, February 1985.
13. A. S. Tanenbaum, M. F. Kaashoek, and H. E. Bal. Parallel programming using shared objects and broadcasting. Computers, 25(8):10-20, August 1990.
14. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.
15. I.-C. Wu and H. T. Kung. Communication complexity for parallel divide-and-conquer. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 151-162, 1991.
16. W. Zimmermann and W. Loewe. An approach to machine-independent parallel programming. In Parallel Programming: CONPAR 94-VAPP VI, pages 277-288. Volume 854 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.