Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs

IEEE Transactions on Parallel and Distributed Systems

Volumn 2, Issue 3, 1991, Pages 264-280

  Mohr, Eric ^a   Kranz, David A ^b   Halstead, Robert H ^c  

^a YALE UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

Load balancing; parallel Lisp; parallel programming language; process migration; program partitionning; task management

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES--LISP; COMPUTER PROGRAMMING--ALGORITHMS;

GRANULARITY PROBLEM; LOAD BALANCING; PARALLEL PROGRAMMING; TASK MANAGEMENT;

COMPUTER SYSTEMS, DIGITAL;

EID: 0026188883     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.86103     Document Type: Article

References (30)

1. A. Agarwal et al., “The MIT Alewife machine: A large-scale distributed- memory multiprocessor,” in Scalable Shared Memory Multiprocessors, M. DuBois and S. Thakkar, Eds. Boston, MA: Kluwer Academic, 1991.
2. A. Agarwal, B.H. Lim, D. Kranz, and J. Kubiatowicz, “APRIL: A processor architecture for multiprocessing,” in Proc. 17th Annu. Int. Symp. Comput. Architecture, Seattle, WA, May 1990, pp. 104–114.
3. Arvind and D. Culler, “Dataflow architectures,” in Annual Reviews in Computer Science. Palo Alto, CA: Annual Reviews, 1986, pp. 225–253.
4. G. Bilardi and A. Nicolau, “Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines,” SIAM J. Comput., vol. 18, no. 2, pp. 216–228, Apr. 1989.
5. D. Chaiken, J. Kubiatowicz, and A. Agarwal, “LimitLESS Directories: A scalable cache coherence scheme,” in Proc. 4th Int. Conf. Architectural Support Programming Languages Oper. Syst., Santa Clara, CA, Apr. 1991.
6. D. E. Culler, “Managing parallelism and resources in scientific dataflow programs,” Ph.D. dissertation, M.I.T. Dep. Elec. Eng. Comput. Sci., Cambridge, MA, June 1989.
7. R. P. Gabriel and J. McCarthy, “Queue-based multi-processing Lisp,” in Proc. 1984 ACM Symp. Lisp and Functional Programming, Austin, TX, Aug. 1984, pp. 25–44.
8. B. Goldberg, “Multiprocessor execution of functional programs,” Int. J. Parallel Programming, vol. 17, no. 5, pp. 425–473, Oct. 1988.
9. R. Goldman and R. P. Gabriel, “Preliminary results with the initial implementation of Qlisp,” in Proc. 1988ACM Symp. Lisp and Functional Programming, Snowbird, UT, July 1988, pp. 143–152.
10. R. Goldman, R. Gabriel, and C. Sexton, “Qlisp: An interim report,” in Proc. U.S./Japan Workshop Parallel Lisp, (Springer-Verlag Lecture Notes in Computer Science 441), T. Ito and R. Halstead, Eds., Sendai, Japan, June 1989, pp. 161–181.
11. J. Gurd, C. Kirkham, and I. Watson, “The Manchester prototype dataflow computer,” Commun. ACM, vol. 28, no. 1, pp. 34–52, Jan. 1985.
12. M. Feeley, “Fine grain parallelism in Multilisp on a shared memory MIMD computer,” Ph.D. dissertation, Brandeis Univ., in preparation.
13. R. Halstead, “Multilisp: A language for concurrent symbolic com-putation,” ACM Trans. Programming Languages Syst., vol. 7, no. 4, pp. 501–538, Oct. 1985.
14. “An assessment of Multilisp: Lessons from experience,” Int. J. Parallel Programming, vol. 15, no. 6, pp. 459–501, Dec. 1986.
15. R.W. Hockney and C. R. Jesshope, Parallel Computers 2. Bristol, England: Adam Hilger, 1988, pp. 475–483.
16. P. Hudak and B. Goldberg, “Serial combinators: 'Optimal' grains of parallelism,” in Functional Programming Languages and Computer Architecture, Springer-Verlag LNCS 201, Sept. 1985, pp. 382–388.
17. D. Kranz, R. Halstead, and E. Mohr, “Mul-T, A high-performance Parallel Lisp,” in Proc. ACM SIGPLAN '89 Conf. Programming Language Design Implementation, Portland, OR, June 1989, pp. 81–90.
18. D. Kranz, R. Kelsey, J. Rees, P. Hudak, J. Philbin, and N. Adams, “Orbit: An optimizing compiler for scheme,” in Proc. SIGPLAN '86 Symp. Compiler Construction, June 1986, pp. 219–233.
19. D. Kranz, “ORBIT: An optimizing compiler for scheme,” Ph.D. dissertation, Yale Univ. Tech. Rep. YALEU/DCS/RR-632, Feb. 1988.
20. E. Mohr, D. Kranz, and R. Halstead, “Lazy task creation: A technique for increasing the granularity of parallel programs,” in Proc. ACM Symp. Lisp and Functional Programming, June 1990, pp. 185–197.
21. “Lazy task creation: A technique for increasing the granularity of parallel programs,” DEC Cambridge Research Lab Tech. Rep. CRL 90/7, Nov. 1990.
22. J. E. B. Moss, “Managing stack frames in Smalltalk,” in Proc. SIGPLAN '87 Symp. Interpreters and Interpretive Techniques, June 1987, pp. 229–240.
23. C.A. Ruggiero and J. Sargeant, “Control of parallelism in the Manchester dataflow machine,” in Functional Programming Languages and Computer Architecture, Springer-Verlag LNCS 274, Portland, OR, Sept. 1987, pp. 1–15.
24. G. Sabot, The Paralation Model. Cambridge, MA: M.I.T. Press, 1988.
25. V. Sarkar and J. Hennessy, “Compile-time partitioning and scheduling of parallel programs,” in Proc. SIGPLAN '86 Symp. Compiler Construction, July 1986, pp. 17–26.
26. G. L. Steele, Jr. and W. D. Hillis, “Connection Machine Lisp: Fine-grained parallel symbolic processing,” in Proc. 1986 ACM Symp. Lisp and Functional Programming, Cambridge, MA, Aug. 1986, pp. 279–297.
27. M. Vandevoorde and E. Roberts, “WorkCrews: An abstraction for controlling parallelism,” Int. J. Parallel Programming, vol. 17, no. 4, pp. 347–366, Aug. 1988.
28. R. C. Waters, “Series,” in Common Lisp: the Language, Second Ed., G. Steele, Jr., ed. Bedford, MA: Digital, pp. 923–955.
29. J. D. Pehoushek and J. S. Weening, “Low-cost process creation and dynamic partitioning in Qlisp,” in Proc. U.S./Japan Workshop Parallel Lisp, Springer-Verlag Lecture Notes in Computer Science 441, T. Ito and R. Halstead, Eds., Sendai, Japan, June 1989, pp. 182–199.
30. J. Weening, “Parallel execution of Lisp programs,” Stanford Comput. Sci. Rep. STANCS-89–1265, June 1989.