Cilk: An Efficient Multithreaded Runtime System

ACM SIGPLAN Notices

Volumn 30, Issue 8, 1995, Pages 207-216

  Blumofe, Robert D ^a   Leiserson, Charles E ^a   Joerg, Christopher F ^a   Randall, Keith H ^a   Kuszmaul, Bradley C ^a   Zhou, Yuli ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976748800     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/209937.209958     Document Type: Article

References (39)

1. Thomas E. Anderson, Brian N. Bershad, Edward D. Lazowska, and Henry M. Levy. Scheduler activations: Effective kernel support for the user-level management of parallelism. In Proceedings of the Thirteenth ACM Symposium on Operating Systems Principles, pages 95–109, Pacific Grove, California, October 1991.
2. Guy E. Blelloch. Programming parallel algorithms. In Proceedings of the 1992 Dartmouth Institute for Advanced Graduate Studies (DAGS) Symposium on Parallel Computation, pages 11–18, Hanover, New Hampshire, June 1992.
3. Robert D. Blumofe and Charles E. Leiserson. Scheduling multithreaded computations by work stealing. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 356–368, Santa Fe, New Mexico, November 1994.
4. Robert D. Blumofe and David S. Park. Scheduling large-scale parallel computations on networks of workstations. In Proceedings of the Third International Symposium on High Performance Distributed Computing, pages 96–105, San Francisco, California, August 1994.
5. Richard P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201-206, April 1974.
6. Eric A. Brewer and Robert Blumofe. Strata: A multi-layer communications library. Technical Report to appear, MIT Laboratory for Computer Science. Available as ftp://ftp.lcs.mit.edu/pub/supertech/strata /strata.tar.Z.
7. F. Warren Burton and M. Ronan Sleep. Executing functional programs on a virtual tree of processors. In Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, pages 187–194, Portsmouth, New Hampshire, October 1981.
8. Martin C. Carlisle, Anne Rogers, John H. Reppy, and Laurie J. Hendren. Early experiences with Olden. In Proceedings of the Sixth Annual Workshop on Languages and Compilers for Parallel Computing, Portland, Oregon, August 1993. [9] Rohit Chandra, Anoop Gupta, and John L. Hennessy. COOL: An object-based language for parallel programming. IEEE Computer, 27(8): 13–26, August 1994.
9. Jeffrey S. Chase, Franz G. Amador, Edward D. Lazowska, Henry M. Levy, and Richard J. Littlefield. The Amber system: Parallel programming on a network of multiprocessors. In Proceedings of the Twelfth ACM Symposium on Operating Systems Principles, pages 147–158, Litchfield Park, Arizona, December 1989.
10. Eric C. Cooper and Richard P. Draves. C Threads. Technical Report CMU-CS-88-154, School of Computer Science, Camegie-Mellon University, June 1988.
11. 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.
12. Rainer Feldmann, Peter Mysliwietz, and Burkhard Monien. Studying overheads in massively parallel min/max-tree evaluation. In Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 94—103, Cape May, New Jersey, June 1994.
13. Raphael Finkel and Udi Manber. DIB—a distributed implementation of backtracking. ACM Transactions on Programming Languages and Systems, 9(2):235-256, April 1987.
14. Vincent W. Freeh, David K. Lowenthal, and Gregory R. Andrews. Distributed Filaments: Efficient fine-grain parallelism on a cluster of workstations. In Proceedings of the First Symposium on Operating Systems Design and Implementation, pages 201–213, Monterey, California, November 1994.
15. R. L. Graham Bounds for certain multiprocessing anomalies. The Bell System Technical Journal, 45:1563-1581, November 1966.
16. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2):416—429, March 1969.
17. Michael Halbherr, Yuli Zhou, and Chris F. Joerg. MIMD-style parallel programming with continuation-passing threads. In Proceedings of the 2nd International Workshop on Massive Parallelism: Hardware, Software, and Applications, Capri, Italy, September 1994.
18. Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501-538, October 1985.
19. W. Hillis and G, Steele. Data parallel algorithms. Communications of the ACM, 29(12): 1170–1183, December 1986.
20. Wilson C. Hsieh, Paul Wang, and William E. Weihl. Computation migration: Enhancing locality for distributed-memory parallel systems. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pages 239–248, San Diego, California, May 1993.
21. Suresh Jagannathan and Jim Philbm. A customizable substrate for concurrent languages. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, pages 55–67, San Francisco, California, June 1992.
22. Chris Joerg and Bradley C. Kuszmaul. Massively parallel chess In Proceedings of the Third DIM ACS Parallel Implementation Challenge, Rutgers University, New Jersey, October 1994. Available as ftp://theory.lcs.mit.edu /pub/cilk/dimacs94.ps.Z.
23. L. V. Kale. The Chare kernel parallel programming system. In Proceedings ofdm the 1990 International Conference on Parallel Processing, Volume II: Software, pages 17–25, August 1990.
24. Vijay Karamcheti and Andrew Chien. Concert—efficient runtime support for concurrent object-oriented programming languages on stock hardware. In Supercomputing '93, pages 598–607, Portland, Oregon, November 1993. [26] Richard M. Karp and Vijaya Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science—Volume A: Algorithms and Complexity, chapter 17, pages 869–941. MIT Press, Cambridge, Massachusetts, 1990.
25. Richard M. Karp and Yanjun Zhang. Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the ACM, 40(3):765-789, July 1993.
26. David A. Kranz, Robert H, Halstead, Jr., and Eric Mohr. Mul-T: A high-performance parallel Lisp. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation, pages 81–90, Portland, Oregon, June 1989.
27. Bradley C. Kuszmaul. Synchronized MIMD Computing. Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, May 1994. Available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-645 or ftp://theory.lcs.mit.edu/pub/bradley/phd.ps.Z.
28. Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, and Robert Zak. The network architecture of the Connection Machine CM-5. In Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 272–285, San Diego, California, June 1992.
29. Pangfeng Liu, William Aiello, and Sandeep Bhatt. An atomic model for message-passing. In Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 154–163, Velen, Germany, June 1993.
30. Eric Mohr, David A. Kranz, and Robert H. Halstead, Jr. Lazy task creation: A technique for increasing the granularity of parallel programs. IEEE Transactions on Parallel and Distributed Systems, 2(3):264-280, July 1991.
31. Rishiyur S. Nikhil. A multithreaded implementation of Id using P-RISC graphs. In Proceedings of the Sixth Annual Workshop on Languages and Compilers for Parallel Computing, number 768 m Lecture Notes in Computer Science, pages 390–405, Portland, Oregon, August 1993. Springer-Verlag.
32. Rishiyur S. Nikhil. Cid: A parallel, shared-memory C for distributed-memory machines. In Proceedings of the Seventh Annual Workshop on Languages and Compilers for Parallel Computing, August 1994.
33. Vijay S. Pande, Christopher F. Joerg, Alexander Yu Grosberg, and Toyoichi Tanaka. Enumerations of the hamiltonian walks on a cubic sublattice. Journal of Physics A, 27, 1994.
34. Martin C. Rinard, Daniel J. Scales, and Monica S. Lam. Jade: A high-level, machine-independent language for parallel programming. Computer, 26(6):28-38, June 1993.
35. 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.
36. V. S. Sunderam. PVM: A framework for parallel distributed computing. Concurrency: Practice and Experience, 2(4):315-339, December 1990.
37. Andrew S. Tanenbaum, Henri E, Bal, and M. Frans Kaashoek. Programming a distributed system using shared objects. In Proceedings of the Second International Symposium on High Performance Distributed Computing, pages 5–12, Spokane, Washington, July 1993.
38. Mark T. Vandevoorde and Eric S. Roberts. WorkCrews: An abstraction for controlling parallelism. International Journal of Parallel Programming, 17(4):347-366, August 1988.
39. I-Chen 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, San Juan, Puerto Rico, October 1991.