Space-efficient scheduling of multithreaded computations

SIAM Journal on Computing

Volumn 27, Issue 1, 1998, Pages 202-229

  Blumofe, Robert D ^a,b   Leiserson, Charles E ^b  

^a University of Texas at Austin   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Multithreaded computing; Parallel algorithms; Parallel computing; Randomized algorithms; Scheduling algorithms; Stack memory; Strict execution

Indexed keywords

EID: 0038036149     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793259471     Document Type: Article

References (45)

1. A. AGARWAL, B.-H. LIM, D. KRANZ, AND J. KUBIATOWICZ, APRIL: A processor architecture for multiprocessing, in Proc. 17th Annual Intl. Symposium on Computer Architecture, Seattle, WA, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 104-114; Tech. Report MIT/LCS/TM-450, MIT Laboratory for Computer Science, Cambridge, MA, 1991.
2. W. C. ATHAS AND C. L. SEITZ, Multicomputers: Message-passing concurrent computers, Computer, 21 (1988), pp. 9-24.
3. S. BHATT, D. GREENBERG, T. LEIGHTON, AND P. LIU, Tight bounds for on-line tree embeddings, in Proc. of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, SIAM, Philadelphia, 1991, pp. 344-350.
4. R. D. BLUMOFE, Managing Storage for Multithreaded Computations, Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1992; Tech. Report MIT/LCS/TR-552, MIT Laboratory for Computer Science, Cambridge, MA, 1992.
5. R. D. BLUMOFE, Executing Multithreaded Programs Efficiently, Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1995.
6. R. D. BLUMOFE, C. F. JOERG, B. C. KUSZMAUL, C. E. LEISERSON, K. H. RANDALL, AND Y. ZHOU, Cilk: An efficient multithreaded runtime system, in Proc. of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), Santa Barbara, CA, ACM, New York, 1995, pp. 207-216.
7. R. D. BLUMOFE AND C. E. LEISERSON, Space-efficient scheduling of multithreaded computations, in Proc. of the 25th Annual ACM Symposium on Theory of Computing (STOC), San Diego, CA, ACM, New York, 1993, pp. 362-371.
8. R. D. BLUMOFE AND C. E. LEISERSON, Scheduling multithreaded computations by work stealing, in Proc. of the 35th Annual Symposium on Foundations of Computer Science (FOCS), Santa Fe, NM, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 356-368.
9. R. D. BLUMOFE AND D. S. PARK, Scheduling large-scale parallel computations on networks of workstations, in Proc. of the Third Intl. Symposium on High Performance Distributed Computing (HPDC), San Francisco, CA, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 96-105.
10. B. BOOTHE AND A. RANADE, Improved multithreading techniques for hiding communication latency in multiprocessors, in Proc. of the 19th Annual Intl. Symposium on Computer Architecture, Gold Coast, Australia, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 214-223.
11. R. P. BRENT, The parallel evaluation of general arithmetic expressions, J. Assoc. Comput. Mach., 21 (1974), pp. 201-206.
12. F. W. BURTON AND M. R. SLEEP, Executing functional programs on a virtual tree of processors, in Proc. of the 1981 Conference on Functional Programming Languages and Computer Architecture, Portsmouth, NH, ACM, New York, 1981, pp. 187-194.
13. D. E. CULLER, Resource Management for the Tagged Token Dataflow Architecture, Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1980; Technical Report MIT/LCS/TR-332, MIT Laboratory for Computer Science, Cambridge, MA, 1985.
14. D. E. CULLER, Managing Parallelism and Resources in Scientific Dataflow Programs, Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1990; Tech. Report MIT/LCS/TR-446, MIT Laboratory for Computer Science, Cambridge, MA, 1990.
15. D. E. CULLER AND ARVIND, Resource requirements of dataflow programs, in Proc. of the 15th Annual Intl. Symposium on Computer Architecture, Honolulu, HI, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 141-150; Computation Structures Group Memo 280, MIT Laboratory for Computer Science, Cambridge, MA, 1987.
16. D. E. CULLER, A. SAH, K. E. SCHAUSER, T. VON EICKEN, AND J. WAWRZYNEK, Fine-grain parallelism with minimal hardware support: A compiler-controlled threaded abstract machine, in Proc. of the Fourth Intl. Conference on Architectural Support for Programming Languages and Operating Systems, Santa Clara, CA, ACM, New York, 1991, pp. 164-175.
17. W. J. DALLY, L. CHAO, A. CHIEN, S. HASSOUN, W. HORWAT, J. KAPLAN, P. SONG, B. TOTTY, AND S. WILLS, Architecture of a message-driven processor, in Proc. of the 14th Annual Intl. Symposium on Computer Architecture, Pittsburgh, PA, IEEE Computer Society Press, Los Alamitos, CA, 1987, pp. 189-196.
18. R. FELDMANN, P. MYSLIWIETZ, AND B. MONIEN, Game tree search on a massively parallel system, Adv. Comput. Chess, 7 (1993), pp. 203-219.
19. V. G. GRAFE AND J. E. HOCH, The Epsilon-2 hybrid dataflow architecture, in Proc. 35th IEEE Computer Society Intl. Computer Conf. (COMPCON 90), San Francisco, CA, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 88-93.
20. R. L. GRAHAM, Bounds for certain multiprocessing anomalies, The Bell System Tech. J., 45 (1966), pp. 1563-1581.
21. R. L. GRAHAM, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17 (1969), pp. 416-429.
22. R. H. HALSTEAD, JR., Multilisp: A language for concurrent symbolic computation, ACM Trans. Prog. Lang. Syst., 7 (1985), pp. 501-538.
23. R. H. HALSTEAD, JR. AND T. FUJITA, MASA: A multithreaded processor architecture for parallel symbolic computing, in Proc. of the 15th Annual Intl. Symposium on Computer Architecture, Honolulu, HI, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 443-451.
24. W. HORWAT, Concurrent Smalltalk on the Message-Driven Processor, Tech. Report MIT/AI/TR-1321, MIT Artificial Intelligence Laboratory, Cambridge, MA, 1991.
25. R. A. IANNUCCI, Toward a dataflow/von Neumann hybrid architecture, in Proc. of the 15th Annual Intl. Symposium on Computer Architecture, Honolulu, HI, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 131-140; Computation Structures Group Memo 275, MIT Laboratory for Computer Science, Cambridge, MA, 1988.
26. S. JAGANNATHAN AND J. PHILBIN, A customizable substrate for concurrent languages, in Proc. of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, San Francisco, CA, ACM, New York, 1992, pp. 55-67.
27. C. KAKLAMANIS AND G. PERSIANO, Branch-and-bound and backtrack search on mesh-connected arrays of processors, in Proc. of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, CA, ACM, New York, 1992, pp. 118-126.
28. R. M. KARP AND Y. ZHANG, A randomized parallel branch-and-bound procedure, in Proc. of the 20th Annual ACM Symposium on Theory of Computing, Chicago, IL, ACM, New York, 1988, pp. 290-300.
29. S. W. KECKLER AND W. J. DALLY, Processor coupling: Integrating compile time and runtime scheduling for parallelism, in Proc. of the 19th Annual Intl. Symposium on Computer Architecture, Gold Coast, Australia, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 202-213.
30. B. C. KUSZMAUL, Synchronized MIMD Computing, Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1994; Tech. Report MIT/LCS/TR-645, MIT Laboratory for Computer Science, 1994; also available online via ftp://theory.lcs.mit.edu/pub/bradley/phd.ps.Z.
31. T. LEIGHTON, M. NEWMAN, A. G. RANADE, AND E. SCHWABE, Dynamic tree embeddings in butterflies and hypercubes, in Proc. of the 1989 ACM Symposium on Parallel Algorithms and Architectures, Santa Fe, NM, ACM, New York, 1989, pp. 224-234.
32. E. MOHR, D. A. KRANZ, AND R. H. HALSTEAD, JR., Lazy task creation: A technique for increasing the granularity of parallel programs, IEEE Trans. Parallel Distrib. Systems, 2 (1991), pp. 264-280.
33. R. S. NIKHIL AND ARVIND, Can dataflow subsume von Neumann computing?, in Proc. of the 16th Annual Intl. Symposium on Computer Architecture, Jerusalem, Israel, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 262-272; Computation Structures Group Memo 292, MIT Laboratory for Computer Science, Cambridge, MA, 1989.
34. R. S. NIKHIL, G. M. PAPADOPOULOS, AND ARVIND, * T: A multithreaded massively parallel architecture, in Proc. of the 19th Annual Intl. Symposium on Computer Architecture, Gold Coast, Australia, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 156-167; Computation Structures Group Memo 325-1, MIT Laboratory for Computer Science, Cambridge, MA, 1991.
35. G. M. PAPADOPOULOS AND K. R. TRAUB, Multithreading: A revisionist view of dataflow architectures, in Proc. of the 18th Annual Intl. Symposium on Computer Architecture, Toronto, Canada, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 342-351; Computation Structures Group Memo 330, MIT Laboratory for Computer Science, Cambridge, MA, 1991.
36. P. RAGHAVAN, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci., 37 (1988), pp. 130-143.
37. A. RANADE, Optimal speedup for backtrack search on a butterfly network, in Proc. of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, Hilton Head, SC, ACM, New York, 1991, pp. 40-48.
38. L. RUDOLPH, M. SLIVKIN-ALLALOUF, AND E. UPFAL, A simple load balancing scheme for task allocation in parallel machines, in Proc. of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, Hilton Head, SC, ACM, New York, 1991, pp. 237-245.
39. C. A. RUGGIERO AND J. SARGEANT, Control of parallelism in the Manchester dataflow ma-chine, in Functional Programming Languages and Computer Architecture, Lecture Notes in Comput. Sci., 274, Springer-Verlag, Berlin, 1987, pp. 1-15.
40. M. SATO, Y. KODAMA, S. SAKAI, Y. YAMAGUCHI, AND Y. KOUMURA, Thread-based programming for the EM-4 hybrid dataflow machine, in Proc. of the 19th Annual Intl. Symposium on Computer Architecture, Gold Coast, Australia, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 146-155.
41. K. R. TRAUB, Sequential Implementation of Lenient Programming Languages, Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1988; Tech. Report MIT/LCS/TR-417, MIT Laboratory for Computer Science, Cambridge, MA, 1988.
42. L. G. VALIANT, A bridging model for parallel computation, Comm. ACM, 33 (1990), pp. 103-111.
43. M. T. VANDEVOORDE AND E. S. ROBERTS, WorkCrews: An abstraction for controlling parallelism, Internat. J. Parallel Programming, 17 (1988), pp. 347-366.
44. T. VON EICKEN, D. E. CULLER, S. C. GOLDSTEIN, AND K. E. SCHAUSER, Active messages: A mechanism for integrated communication and computation, in Proc. of the 19th Annual Intl. Symposium on Computer Architecture, Gold Coast, Australia, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 256-266.
45. Y. ZHANG, Parallel Algorithms for Combinatorial Search Problems, Ph.D. thesis, Department of Electrical Engineering and Computer Science, University of California at Berkeley, 1989; Tech. Report UCB/CSD 89/543, University of California at Berkeley, Computer Science Division, 1989.