Cilk: An efficient multithreaded runtime system

Journal of Parallel and Distributed Computing

Volumn 37, Issue 1, 1996, Pages 55-69

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b University of Texas at Austin   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

^d Yale University   (United States)

^e LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030601279     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0107     Document Type: Article

References (44)

1. 1. Anderson, T. E., Bershad, B. N., Lazowska, E. D., and Levy, H. M. Scheduler activations: Effective kernel support for the user-level management of parallelism. Proceedings of the Thirteenth ACM Symposium on Operating Systems Principles, pp. 95-109, Pacific Grove, California, Oct. 1991.
2. 2. Blelloch, G. E. Programming parallel algorithms. Proceedings of the 1992 Dartmouth Institute for Advanced Graduate Studies (DAGS) Symposium on Parallel Computation, pp. 11-18, Hanover, New Hampshire, Jun. 1992.
3. 3. Blumofe, R. D. Executing multithreaded programs efficiently. Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Sep. 1995.
4. 4. Blumofe, R. D., and Leiserson, C. E. Scheduling multithreaded computations by work stealing. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 356-368, Santa Fe, New Mexico, Nov. 1994.
5. 5. Blumofe, R. D., and Park, D. S. Scheduling large-scale parallel computations on networks of workstations. Proceedings of the Third International Symposium on High Performance Distributed Computing, pp. 96-105, San Francisco, California, Aug. 1994.
6. 6. Brent, R. P. The parallel evaluation of general arithmetic expressions. J. Assoc. Comput. Mach. 21(2), 201-206 (Apr. 1974).
7. 7. Brewer, E. A., and Blumofe, R. 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.
8. 8. Burton, F. W., and Sleep, M. R. Executing functional programs on a virtual tree of processors. Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, pp. 187-194, Portsmouth, New Hampshire, Oct. 1981.
9. 9. Carlisle, M. C., Rogers, A., Reppy, J. H., and Hendren, L. J. Early experiences with Olden. Proceedings of the Sixth Annual Workshop on Languages and Compilers for Parallel Computing, Portland, Oregon, Aug. 1993.
10. 10. Chandra, R., Gupta, A., and Hennessy, J. L. COOL: An object-based language for parallel programming. IEEE Comput. 27(8), 13-26 (Aug. 1994).
11. 11. Chase, J. S., Amador, F. G., Lazowska, E. D., Levy, H. M., and Littlefield, R. J. The Amber system: Parallel programming on a network of multiprocessors. Proceedings of the Twelfth ACM Symposium on Operating Systems Principles, pp. 147-158, Litchfield Park, Arizona, Dec. 1989.
12. 12. Cooper, E. C., and Draves, R. P. C Threads. Tech. Rep. CMU-CS-88-154, School of Computer Science, Carnegie-Mellon University, Jun. 1988.
13. 13. Culler, D. E., Sah, A., Schauser, K. E., von Eicken, T., and Wawrzynek, J. Fine-grain parallelism with minimal hardware support: A compiler-controlled threaded abstract machine. Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 164-175, Santa Clara, California, Apr. 1991.
14. 14. Feldmann, R., Mysliwietz, P., and Monien, B. Studying overheads in massively parallel min/max-tree evaluation. Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 94-103, Cape May, New Jersey, Jun. 1994.
15. 15. Finkel, R., and Manber, U. DIB - A distributed implementation of backtracking. ACM Trans. Programming Languages and Systems 9(2), 235-256 (Apr. 1987).
16. 16. Freech, V. W., Lowenthal, D. K., and Andrews, G. R. Distributed Filaments: Efficient fine-grain parallelism on a cluster of workstations. Proceedings of the First Symposium on Operating Systems Design and Implementation, pp. 201-213, Monterey, California, Nov. 1994.
17. 17. Goldstein, S. C., Schauser, K. E., and Culler, D. Enabling primitives for compiling parallel languages. Third Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, Troy, New York, May 1995.
18. 18. Graham, R. L. Bounds for certain multiprocessing anomalies. Bell System Tech. J. 45, 1563-1581 (Nov. 1966).
19. 19. Graham, R. L. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416-429 (Mar. 1969).
20. 20. Halbherr, M., Zhou, Y., and Joerg, C. F. MIMD-style parallel programming with continuation-passing threads. Proceedings of the 2nd International Workshop on Massive Parallelism: Hardware, Software, and Applications, Capri, Italy, Sep. 1994.
21. 21. Halstead, R. H. Jr., Multilisp: A language for concurrent symbolic computation. ACM Trans. Programming Languages and Systems 7(4), 501-538 (Oct. 1985).
22. 22. Hillis, W., and Steele, G. Data parallel algorithms. Comm. ACM 29(12), 1170-1183 (Dec. 1986).
23. 23. Hsieh, W. C., Wang, P., and Weihl, W. E. Computation migration: Enhancing locality for distributed-memory parallel systems. Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 239-248, San Diego, California, May 1993.
24. 24. Jagannathan, S., and Philbin, J. A customizable substrate for concurrent languages. Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, pp. 55-67, San Francisco, California, Jun. 1992.
25. 25. Joerg, C., and Kuszmaul, B. C. Massively parallel chess. Proceedings of the Third DIMACS Parallel Implementation Challenge, Rutgers University, New Jersey, Oct. 1994. Available as ftp:// theory.lcs.mit.edu/pub/cilk/dimacs94.ps.Z.
26. 26. Kalé, L. V. The Chare kernel parallel programming system. Proceedings of the 1990 International Conference on Parallel Processing, Volume II: Software, pp. 17-25, Aug. 1990.
27. 27. Karamcheti, V., and Chien, A. Concert - Efficient runtime support for concurrent object-oriented programming languages on stock hardware. Supercomputing '93, pp. 598-607, Portland, Oregon, Nov. 1993.
28. 28. Karp, R. M., and Ramachandran, V. Parallel algorithms for shared-memory machines. In van Leeuwen, J., (Ed.). Handbook of Theoretical Computer Science - Volume A: Algorithms and Complexity, Chap. 17, pp. 869-941. MIT Press, Cambridge, Massachusetts, 1990.
29. 29. Karp, R. M., and Zhang, Y. Randomized parallel algorithms for backtrack search and branch-and-bound computation. J. Assoc. Comput. Mach. 40(3), 765-789 (Jul. 1993).
30. 30. Kranz, D. A., Halstead, R. H., Jr., and Mohr, E. Mul-T: A high-performance parallel Lisp. Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation, pp. 81-90, Portland, Oregon, Jun. 1989.
31. 31. Kuszmaul, B. C. 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.
32. 32. Leiserson, C. E., Abuhamdeh, Z. S., Douglas, D. C., Feynman, C. R., Ganmukhi, M. N., Hill, J. V., Hillis, W. D., Kuszmaul, B. C., St. Pierre, M. A., Wells, D. S., Wong, M. C., Yang, S.-W., and Zak, R. The network architecture of the Connection Machine CM-5. Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 272-285, San Diego, California, Jun. 1992.
33. 33. Liu, P., Aiello, W., and Bhatt, S. An atomic model for message-passing. Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 154-163, Velen, Germany, Jun. 1993.
34. 34. Miller, R. C. A type-checking preprocessor for Cilk 2, a multithreaded C language. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, May 1995.
35. 35. Mohr, E., Kranz, D. A., and Halstead, Jr., R. H. Lazy task creation: A technique for increasing the granularity of parallel programs. IEEE Trans. Parallel Distrib. Systems 2(3), 264-280 (Jul. 1991).
36. 36. Nikhil, R. S. A multithreaded implementation of Id using P-RISC graphs. Proceedings of the Sixth Annual Workshop on Languages and Compilers for Parallel Computing, Portland, Oregon, Aug. 1993. Lecture Notes in Computer Science, Vol. 768, pp. 390-405, Springer-Verlag, Berlin/New York.
37. 37. Nikhil, R. S. Cid: A parallel, shared-memory C for distributed-memory machines. Proceedings of the Seventh Annual Workshop on Languages and Compilers for Parallel Computing, Aug. 1994.
38. 38. Pande, V. S., Joerg, C. F., Grosberg, A. Y., and Tanaka, T. Enumerations of the hamiltonian walks on a cubic sublattice. J. Phys. A 27 (1994).
39. 39. Rinard, M. C., Scales, D. J., and Lam, M. S. Jade: A high-level, machine-independent language for parallel programming. Computer 26(6), 28-38 (Jun. 1993).
40. 40. Rudolph, L., Slivkin-Allalouf, M., and Upfal, E. A simple load balancing scheme for task allocation in parallel machines. Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 237-245, Hilton Head, South Carolina, Jul. 1991.
41. 41. Sunderam, V. S. PVM: A framework for parallel distributed computing. Concurrency: Practice and Experience 2(4), 315-339 (Dec. 1990).
42. 42. Tanenbaum, A. S., Bal, H. E., and Kaashoek, M. F. Programming a distributed system using shared objects. Proceedings of the Second International Symposium on High Performance Distributed Computing, pp. 5-12, Spokane, Washington, Jul. 1993.
43. 43. Vandevoorde, M. T., and Roberts, E. S. WorkCrews: An abstraction for controlling parallelism. Internat. J. Parallel Programming 17(4), 347-366 (Aug. 1988).
44. 44. Wu, I.-C., and Kung, H. T. Communication complexity for parallel divide-and-conquer. Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pp. 151-162, San Juan, Puerto Rico, Oct. 1991.