Scheduling multithreaded computations by work stealing

Journal of the ACM

Volumn 46, Issue 5, 1999, Pages 720-748

  Blumofe, Robert D ^a,b,c,d   Leiserson, Charles E ^a   Blumofe, R D ^a   Leiserson, C E ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c University of Texas at Austin   (United States)

^d NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL THREADS; SERIAL SPACES; WORK STEALING; WORK-SHARING COUNTERPARTS;

ALGORITHMS; COMPUTATIONAL METHODS; MULTIPROCESSING PROGRAMS; PARALLEL PROCESSING SYSTEMS; PROGRAM DEBUGGING; SYNCHRONIZATION;

SCHEDULING;

EID: 0000269759     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/324133.324234     Document Type: Article

References (46)

1. ARORA, N. S., BLUMOFE, R. D., PLAXTON, C. G. 1998. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'98) (Puerto Vallarta, Mexico, June 28-July 2). ACM, New York, pp. 119-129.
2. ARVIND, NIKHIL, R. S., PINGALI, K. K. 1989. I-structures: Data structures for parallel computing. ACM Trans. Program. Lang. Syst. 11, 4 (Oct.), 598-632.
3. BLELLOCH, G. E., GIBBONS, P. B., MATIAS, Y. 1995. Provably efficient scheduling for languages with fine-grained parallelism. In Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'95) (Santa Barbara, Calif., July 17-19). ACM, New York, pp. 1-12.
4. BLELLOCH, G. E., GIBBONS, P. B., MATIAS, Y., NARLIKAR, G. J. 1997. Space-efficient scheduling of parallelism with synchronization variables. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'97) (Newport, R.I., June 22-25). ACM, New York, pp. 12-23.
5. BLUMOFE, R. D. 1995. Executing multithreaded programs efficiently. Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology. Also available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-677.
6. BLUMOFE, R. D., FRIGO, M., JOERG, C. F., LEISERSON, C. E., RANDALL, K. H. 1996a. An analysis of dag-consistent distributed shared-memory algorithms. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'96) (Padua, Italy, June 24-26). ACM, New York, pp. 297-308.
7. BLUMOFE, R. D., FRIGO, M., JOERG, C. F., LEISERSON, C. E., RANDALL, K. H. 1996b. Dag-consistent distributed shared memory. In Proceedings of the 10th International Parallel Processing Symposium (IPPS) (Honolulu, Hawaii, April). IEEE Computer Society Press, Los Alamitos, Calif., pp. 132-141.
8. BLUMOFE, R. D., JOERG, C. F., KUSZMAUL, B. C., LEISERSON, C. E., RANDALL, K. H., ZHOU, Y. 1996c. Cilk: An efficient multithreaded runtime system. J. Paral. Dist. Comput. 37, 1 (Aug.), 55-69.
9. BLUMOFE, R. D., LEISERSON, C. E. 1998. Space-efficient scheduling of multithreaded computations. SIAMJ. Comput. 27, 1 (Feb.), 202-229.
10. BLUMOFE, R. D., LISIECKI, P. A. 1997. Adaptive and reliable parallel computing on networks of workstations. In Proceedings of the USENIX 1997 Annual Technical Conference on UNIX and Advanced Computing Systems (Anaheim, Calif., Jan.). USENIX Associates, Berkeley, Calif., pp. 133-147.
11. BLUMOFE, R. D., PAPADOPOULOS, D. 1998. The performance of work stealing in multiprogrammed environments. Tech. Rep. TR-98-13 (May). Dept. Computer Sciences, The University of Texas at Austin, Austin, Tex.
12. BRENT, R. P. 1974. The parallel evaluation of general arithmetic expressions. J. ACM 21, 2 (Apr.), 201-206.
13. BURTON, F. W. 1988. Storage management in virtual tree machines. IEEE Trans. Comput. 37, 3 (Mar.), 321-328.
14. BURTON, F. W. 1996. Guaranteeing good memory bounds for parallel programs. IEEE Trans. Softtv. Eng. 22, 10 (Oct.), 762-773.
15. BURTON, F. W., SLEEP, M. R. 1981. Executing functional programs on a virtual tree of processors. In Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture (Portsmouth, N.H., Oct.). ACM, New York, N.Y., pp. 187-194.
16. CHENG, G.-I. 1998. Algorithms for data-race detection in multithreaded programs. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology-
17. CHENG, G.-I., FENG, M., LEISERSON, C. E., RANDALL, K. H., STARK, A. F. 1998. Detecting data races in Cilk programs that use locks. In Proceedings of the 10th ACM Symposium on Parallel Algorithms and Architectures (SPAA'98) (Puerto Vallarta, Mexico, June 28-July 2). ACM, New York, pp. 298-309.
18. CULLER, D. E., ARVIND. 1988. Resource requirements of dataflow programs. In Proceedings of the 15th Annual International Symposium on Computer Architecture (ISCA) (Honolulu, Hawaii, May). IEEE Computer Society Press, Los Alamitos, Calif., pp. 141-150. Also available as MIT Laboratory for Computer Science, Computation Structures Group Memo 280.
19. EAGER, D. L., ZAHORJAN, J., LAZOWSKA, E. D. 1989. Speedup versus efficiency in parallel systems. IEEE Trans. Comput. 38, 3 (Mar.), 408-423.
20. FELDMANN, R., MYSLIWIETZ, P., MONIEN, B. 1993. Game tree search on a massively parallel system. Adv. Comput. Chess 7, 203-219.
21. FENG, M., LEISERSON, C. E. 1997. Efficient detection of determinacy races in Cilk programs. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'97) (Newport, R.I., June 22-25). ACM, New York, pp. 1-11.
22. FINKEL, R., MANBER, U. 1987. DIB-A distributed implementation of backtracking. ACM Trans. Program. Lang. Syst. 9, 2 (Apr.), 235-256.
23. FRIGO, M. 1998. The weakest reasonable memory model. Master's thesis, Dept. Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Mass.
24. FRIGO, M., LEISERSON, C. E., RANDALL, K. H. 1998. The implementation of the Cilk-5 multithreaded language. In Proceedings of the 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'98) (Montreal, Canada, June 17-19). ACM, New York.
25. FRIGO, M., LUCHANGCO, V. 1998. Computation-centric memory models. In Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'98) (Puerto Vallarta, Mexico, June 28-July 2). ACM, New York, pp. 240-249.
26. GRAHAM, R. L. 1966. Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563-1581.
27. GRAHAM, R. L. 1969. Bounds on multiprocessing timing anomalies. SLAM J. Appl. Math. 17, 2 (Mar.), 416-429.
28. HALBHERR, M., Zuou, Y., JOERG, C. F. 1994. MIMD-style parallel programming with continuation-passing threads. In Proceedings of the 2nd International Workshop on Massive Parallelism: Hardware, Sofrn-are, and Applications (Capri, Italy, Sept.). World Scientific, Singapore. (Also available as MIT Laboratory for Computer Science Computation Structures, Group Memo 355, March 1994. MIT, Cambridge, Mass.
29. HALSTEAD, R. H., 1984. Implementation of Multilisp: Lisp on a multiprocessor. In Conference Record of the 1984 ACM Symposium on LISP and Functional Programming (Austin, Tcx., Aug.) ACM, New York, pp. 9-17.
30. JOERG, C. F. 1996. The Cilk System for Parallel Multithreaded Computing. Ph.D. dissertation. Dept. Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Mass.
31. JOERG, C., KUSZMAUL, B. C. 1994. Massively parallel chess. In Proceedings of the 3rd DIMACS Parallel Implementation Challenge (Rutgers University, New Jersey, Oct. 1994).
32. KARP, R. M., ZHANG, Y. 1993. Randomized parallel algorithms for backtrack search and branch-and-bound computation. J. ACM 40, 3 (July), 765-789.
33. KUSZMAUL, B. C. 1994. Synchronized MIMD computing. Ph.D. thesis, Dept. Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Mass. Also available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-645.
34. LISIECKI, P. 1996. Macroscheduling in the Cilk network of workstations environment. Master's thesis, Dept. Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Mass.
35. LlU, P., AIELLO, W., BHATT, S. 1993. An atomic model for message-passing. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'93) (Velen, Germany, June 30-July 2). ACM, New York, pp. 154-163.
36. MOHR, E., KRANZ, D. A., HALSTEAD, R. H., 1991. Lazy task creation: A technique for increasing the granularity of parallel programs. IEEE Trans. Parall. Dist. Syst. 2, 3 (July), 264-280.
37. PANDE, V. S., JOERG, C. F., GROSBERG, A. Y., TANAKA, T. 1994. Enumerations of the Hamiltonian walks on a cubic sublattice. J. Phys. A 27.
38. PAPADOPOULOS, D. P. 1998. Hood: A user-level thread library for multiprogramming multiprocessors. Master's thesis, Dept. Computer Sciences, The University of Texas at Austin, Austin, Tex.
39. RANADE, A. 1987. How to emulate shared memory. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science (FOCS) (Los Angeles, Calif., Oct.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 185-194.
40. RANDALL, K. H. 1998. Cilk: Efficient multithreaded computing. Ph.D. dissertation. Dept. Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Mass.
41. RUDOLPH, L., SLIVKIN-ALLALOUF, M., UPFAL, E. 1991. A simple load balancing scheme for task allocation in parallel machines. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91) (Hilton Head, S.C., July 21-24). ACM, New York, pp. 237-245.
42. RUGGIERO, C. A., SARGEANT, J. 1987. Control of parallelism in the Manchester dataflow machine. In Functional Programming Languages and Computer Architecture, Number 274 in Lecture Notes in Computer Science. Springer-Verlag, New York, pp. 1-15.
43. STARK, A. F. 1998. Debugging multithreaded programs that incorporate user-level locking. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Mass.
44. VANDEVOORDE, M. T., ROBERTS, E. S. 1988. WorkCrews: An abstraction for controlling parallelism. IntemationalJoumal of Parallel Programming 17, 4 (Aug.), 347-366.
45. WU, I.-C., KUNG, H. T. 1991. Communication complexity for parallel divide-and-conquer. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS) (San Juan, Puerto Rico, Oct. 1991). IEEE Computer Society Press, Los Alamitos, Calif., pp. 151-162.
46. ZHANG, Y., ORTYNSKI, A. 1994. The efficiency of randomized parallel backtrack search. In Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing (Dallas, Texas, Oct. 1994). IEEE Computer Society Press, Los Alamitos, Calif.