Abstract
Our experiments with Qlisp have led to two ways of improving the performance of parallel Lisp programs. One is to reduce the cost of process creation and scheduling; the other is to use a dynamic partitioning and scheduling method. We describe these techniques and present the results of several experiments that use them. We also present an analysis of the dynamic partitioning method to explain the reasons for its success.
Preview
Unable to display preview. Download preview PDF.
References
Richard P. Gabriel. Performance and Evaluation of Lisp Systems. Computer Systems Series, MIT Press, Cambridge, Massachusetts, 1985.
Richard P. Gabriel and John McCarthy. Queue-based multiprocessing Lisp. In Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming, pages 25–44, Austin, Texas, August 1984.
Ron Goldman, Richard P. Gabriel, and Carol Sexton. Qlisp: Parallel processing in Lisp. In Proceedings of the US/Japan Workshop on Parallel Lisp, June 1989.
Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501–538, October 1985.
Joseph S. Weening. Parallel execution of Lisp programs. Technical Report STANCS-89-1265, Stanford University, Stanford, California, June 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pehoushek, J.D., Weening, J.S. (1990). Low-cost process creation and dynamic partitioning in Qlisp. In: Ito, T., Halstead, R.H. (eds) Parallel Lisp: Languages and Systems. PSC 1989. Lecture Notes in Computer Science, vol 441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024155
Download citation
DOI: https://doi.org/10.1007/BFb0024155
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52782-4
Online ISBN: 978-3-540-47143-1
eBook Packages: Springer Book Archive