Space-efficient scheduling of multithreaded computations

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 362-371

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; SCHEDULING; SYSTEM-IN-PACKAGE; AUTOMATA THEORY; COMPUTATIONAL METHODS; DATA PROCESSING; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; QUEUEING THEORY;

DECENTRALIZED ALGORITHMS; GRAPH THEORETIC MODELING; IMPROVE PERFORMANCE; MULTITHREADED COMPUTATION; PARALLEL COMPUTATION; PROCESSOR EXECUTION; SCHEDULING DYNAMICS; SPACE-EFFICIENT SCHEDULING;

COMPUTATIONAL EFFICIENCY; STORAGE ALLOCATION (COMPUTER);

MULTITHREADED COMPUTATIONS; SPACE EFFICIENT SCHEDULING;

EID: 0027208503     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167196     Document Type: Conference Paper

References (25)

1. Anant Agarwal, Beng-Hong Lim, David Kranz, and John Kubiatowicz. APRIL: A processor architecture for multiprocessing. In Proceedings of the 17th Annual International Symposium on Computer Architecturepages 104-114, Seattle, Washington, May 1990.
2. Sandeep Bhatt, David Greenberg, Tom Leighton, and Pangfeng Liu. Tight bounds for on-line tree embed- dings. In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages 344-350, San Francisco, California, January 1991.
3. Robert D. Blumofe. Managing storage for multithreaded computations. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, September 1992. Also: MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-552.
4. Bob Boothe and Abhiram Ranade. Improved multithreading techniques for hiding communication latency in multiprocessors. In Proceedings of the 19th Annual International Symposium on Computer Architecture, pages 214-223, Gold Coast, Australia, May 1992.
5. Richard P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201- 206, April 1974.
6. David E. Culler. Resource management for the tagged token dataflow architecture. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, January 1980.
7. David E. Culler and Arvind. Resource requirements of dataflow programs. In Proceedings of the 15th Annual International Symposium on Computer Architecture, pages 141-150, Honolulu, Hawaii, May 1988.
8. David E. Culler, Anurag Sah, Klaus Erik Schauser, Thorsten von Eicken, and John Wawrzynek. Fine- grain parallelism with minimal hardware support: A compiler-controlled threaded abstract machine. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 164-175, Santa Clara, California, April 1991.
9. William J. Dally, Linda Chao, Andrew Chien, Soha Hassoun, Waldemar Horwat, Jon Kaplan, Paul Song, Brian Totty, and Scott Wills. Architecture of a message-driven processor. In Proceedings of the l^th Annual International Symposium on Computer Architecture, pages 189-196, Pittsburgh, Pennsylvania, June 1987.
10. R. Feldmann, P. Mysliwietz, and B. Monien. A fully distributed chess program. Technical Report 79, University of Paderborn, Germany, February 1991.
11. V. G. Grafe and J. E. Hoch. The Epsilon-2 hybrid dataflow architecture. In COMPCON 90, pages 88-93, San Francisco, California, February 1990.
12. Robert H. Halstead Jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501-538, October 1985.
13. Robert A. Iannucci. Toward a dataflow/von Neumann hybrid architecture. In Proceedings of the 15th Annual International Symposium on Computer Architecture, pages 131-140, Honolulu, Hawaii, May 1988.
14. Christos Kaklamanis and Giuseppe Persiano. Branch-And-bound and backtrack search on mesh-connected arrays of processors. In Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 118-126, San Diego, California, June 1992.
15. Richard M. Karp and Yanjun Zhang. A randomized parallel branch-And-bound procedure. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 290-300, Chicago, Illinois, May 1988.
16. Bradley Kuszmaul. Private communication, February 1993.
17. Tom Leighton, Mark Newman, Abhiram G. Ranaude, and Eric Schwabe. Dynamic tree embeddings in butterflies and hypercubes. In Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, pages 224-234, Santa Fe, New Mexico, June 1989.
18. Prabhakar Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37(2):130-143, October 1988.
19. Abhiram Ranade. Optimal speedup for backtrack search on a butterfly network. In Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, pages 40-48, Hilton Head, South Carolina, July 1991.
20. Larry Rudolph, Miriam Slivkin-Allalouf, and Eli Upfal. A simple load balancing scheme for task allocation in parallel machines. In Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, pages 237-245, Hilton Head, South Carolina, July 1991.
21. Carlos A. Ruggiero and John Sargeant. Control of parallelism in the Manchester dataflow machine. In Functional Programming Languages and Computer Architecture, number 274 in Lecture Notes in Computer Science, pages 1-15. Springer-Verlag, 1987.
22. Mitsuhisa Sato, Yuetsu Kodama, Shuichi Sakai, Yoshinori Yamaguchi, and Yasuhito Koumura. Thread-based programming for the EM-4 hybrid dataflow machine. In Proceedings of the 19th Annual International Symposium on Computer Architecture, pages 146-155, Gold Coast, Australia, May 1992.
23. Leslie G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.
24. Thorsten von Eicken, David E. Culler, Seth Copen Goldstein, and Klaus Erik Schauser. Active messages: A mechanism for integrated communication and computation. In Proceedings of the 19th Annual International Symposium on Computer Architecture, pages 256-266, Gold Coast, Australia, May 1992.
25. Yanjun Zhang. Parallel Algorithms for Combinatorial Search Problems. PhD thesis, Department of Electrical Engineering and Computer Science, University of California at Berkeley, November 1989.