Online scheduling of parallel programs on heterogeneous systems with applications to Cilk

Theory of Computing Systems

Volumn 35, Issue 3, 2002, Pages 289-304

  Bender, Michael A ^a   Rabin, Michael O ^b  

^a Stony Brook University   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROGRAMS;

ALGORITHMS; ONLINE SYSTEMS; PROBLEM SOLVING; SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 0036590677     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-002-1055-5     Document Type: Conference Paper

References (36)

1. N. Arora, R. Blumofe, and G. Plaxton. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 119-129, 1998.
2. Y. Aumann, M. A. Bender, and L. Zhang. Efficient execution of nondeterministic parallel programs on asynchronous systems. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 270-276, 1996.
3. Y. Aumann, M. A. Bender, and L. Zhang. Efficient execution of nondeterministic parallel programs on asynchronous systems. Information and Computation, 139(1):2-16, Nov. 1997.
4. Y. Aumann, K. Palem, Z. Kedem, and M. O. Rabin. Highly efficient asynchronous execution of large grained parallel programs. In Proceedings of the 34th Annual Symposium on the Foundations of Computer Science (FOCS), pages 271-280, Nov. 1993.
5. Y. Aumann and M. O. Rabin. Clock construction in fully asynchronous parallel systems and PRAM simulation. In Proceedings of the 33rd Annual Symposium on the Foundations of Computer Science (FOCS), pages 147-156, 1992.
6. Y. Aumann and M. O. Rabin. Clock construction in fully asynchronous parallel systems and PRAM simulation. Theoretical Computer Science, 128:3-30, 1994.
7. B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pages 198-205, May 1999.
8. M. A. Bender and M. O. Rabin. Scheduling Cilk multithreaded computations on processors of different speeds. In Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 13-21, July 2000.
9. R. D. Blumofe. Executing Multithreaded Programs Efficiently. Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Sept. 1995.
10. R. Blumofe. Scheduling multithreaded computations by work stealing. Seminar Talk. Joint work with N. Arora C. Leiserson, and G. Plaxton. http://www.cs.utexas.edu/users/rdb/talks/ws.ppt., 1998.
11. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. Journal of Parallel and Distributed Computing, 37(1):55-69, Aug. 1996.
12. R. D. Blumofe and C. E. Leiserson. Space-efficient scheduling of multithreaded computations. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC), pages 362-371, San Diego, California, May 1993.
13. R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), pages 356-368. Santa Fe, New Mexico, Nov. 1994.
14. R. P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201-206, Apr. 1974.
15. C. Chekuri and M. A. Bender. An efficient approximation algorithm for minimizing makespan on uniformly related machines. In Proceedings of the Sixth Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, volume 1412, pages 383-393. Springer-Verlag, Berlin, 1998.
16. C. Chekuri and M. A. Bender. An efficient approximation algorithm for minimizing makespan on uniformly related machines. Journal of Algorithms, 41:212-224, 2001.
17. F. A. Chudak and D. B. Shmoys. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds (extended abstract). In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 581-590, New Orleans, Louisiana, 5-7 Jan. 1997.
18. F. A. Chudak and D. B. Shmoys. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. Journal of Algorithms, 30(2):323-343, February 1999.
19. E. G. Coffman and P. J. Denning. Operating Systems Theory. Prentice-Hall, Englewood Cliffs, New Jersey, 1973.
20. R. Cole and O. Zajicek. The expected advantage of asynchrony. In Proceedings of the ACM Symposium on Parallel Architectures and Algorithms (SPAA), pages 85-94, 1989.
21. P. B. Gibbons. A more practical PRAM model. In Proceedings of the 1st ACM Symposium on Parallel Architectures and Algorithms (SPAA), pages 158-168, June 1989.
22. R.L. Graham. Bounds for certain multiprocessing anomalies. The Bell System Technical Journal, 45:1563-1581, Nov. 1966.
23. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2):416-429, Mar. 1969.
24. J. M. Jaffe. An analysis of preemptive multiprocessor job scheduling. Mathematics of Operations Research, 5(3):415-421, Aug. 1980.
25. J.M. Jaffe. Efficient scheduling of tasks without full use of processor resources. Theoretical Computer Science, 12:1-17, Aug. 1980.
26. P. Kanellakis and A. Shvartsman. Efficient parallel algorithms can be made robust. In Proceedings of the 8th Annual ACM Symposium on the Principles of Distributed Computing (PODC), pages 211-221, 1989.
27. P. Kanellakis and A. Shvartsman. Effecient parallel algorithms on restartable fail-stop processors. In Proceedings of the 10th Annual ACM Symposium on the Principles of Distributed Computing (PODC), pages 23-36, 1991.
28. P. Kanellakis and A. Shvartsman. Fault-Tolerant Parallel Computation. Kluwer Academic, Dordrecht, 1997.
29. Z. M. Kedem, K. V. Palem, M. O. Rabin, and A. Raghunathan. Efficient program transformation for resilient parallel computation via randomization. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC), pages 306-317, May 1992.
30. Z. M. Kedem, K. V. Palem, A. Raghunathan, and P. G. Spirakis. Combining tentative and definite executions for very fast dependable parallel computing. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC), pages 381-390, May 1991.
31. Z. M. Kedem, K. V. Palem, and P. G. Spirakis. Efficient robust parallel computations. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 138-148, May 1990.
32. J. W. W. Liu and C. L. Liu. Bounds on scheduling algorithms for heterogeneous computing systems. In J. L. Rosenfeld (ed.). Information Processing 74 (Proceedings of IFIP Congress 74, Stockholm, August 5-10, 1974), pages 349-353. North-Holland, Amsterdam, 1974.
33. C. Martel, A. Park, and R. Subramonian. Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In Proceedings of the 31st Annual Symposium on the Foundations of Computer Science (FOCS), pages 590-599, 1990.
34. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, June 1995.
35. N. Nishimura. Asynchronous shared memory parallel computation. In Proceedings of the 2nd ACM Symposium on Parallel Architectures and Algorithms (SPAA), pages 76-84, 1990.
36. J. Ullman. NP-complete scheduling problems. Journal of Computer and System Sciences, 10:384-393.