Abstract
Lazy task creation (LTC) has proven to be an effective dynamic partitioning strategy for parallel Lisp systems. I describe here a key to the success of LTC (always package the parent instead of the child task at potential fork points) and two optimizations whose value extends to standard scheduling strategies (give scheduling preference to the child task, and use double-ended task queues). I also argue that research on real-world applications is strongly needed at this point as opposed to further system optimizations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Halstead, “An Assessment of Multilisp: Lessons from Experience,” Int'l. J. of Parallel Programming 15:6, Dec. 1986, pp. 459–501.
R. Halstead, New Ideas in Parallel Lisp: Language Design, Implementation, and Programming Tools,” in T. Ito and R. Halstead, eds., Proceedings of U.S./Japan Workshop on Parallel Lisp (Springer-Verlag Lecture Notes in Computer Science 441), Sendai, Japan, June 1989, pp. 2–57.
S. Jagannathan and J. Philbin, “A Foundation for an Efficient Multi-Threaded Scheme System,” Proceedings of ACM Symposium on Lisp and Functional Programming, June 1992, pp. 345–357.
D. Kranz, R. Halstead, and E. Mohr, “Mul-T, A High-Performance Parallel Lisp”, ACM SIGPLAN '89 Conference on Programming Language Design and Implementation, Portland, OR, June 1989, pp. 81–90.
E. Mohr, “Dynamic Partitioning of Parallel Lisp Programs,” Ph.D. Thesis, Yale University Technical Report YALEU/DCS/RR-869, May 1991.
E. Mohr, D. Kranz, and R. Halstead, “Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs,” Proceedings of ACM Symposium on Lisp and Functional Programming, June 1990, pp. 185–197.
E. Mohr, D. Kranz, and R. Halstead, “Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs,” IEEE Trans. on Parallel and Distributed Systems 2:3, July 1991, pp. 264–280.
J. Pehoushek and J. Weening, “Low-cost process creation and dynamic partitioning in Qlisp,” in T. Ito and R. Halstead, eds., Proceedings of U.S./Japan Workshop on Parallel Lisp (Springer-Verlag Lecture Notes in Computer Science 441), Sendai, Japan, June 1989, pp. 182–199.
M. Vandevoorde and E. Roberts, “WorkCrews: An Abstraction for Controlling Parallelism,” Int'l. J. of Parallel Programming 17:4, August 1988, pp. 347–366.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mohr, E. (1993). Distillations of dynamic partitioning experience. In: Halstead, R.H., Ito, T. (eds) Parallel Symbolic Computing: Languages, Systems, and Applications. PSC 1992. Lecture Notes in Computer Science, vol 748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018648
Download citation
DOI: https://doi.org/10.1007/BFb0018648
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57396-8
Online ISBN: 978-3-540-48133-1
eBook Packages: Springer Book Archive