Low-cost process creation and dynamic partitioning in Qlisp
- 109 Downloads
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.
KeywordsIdle Time Process Creation Computation Tree Queue Size Partitioning Method
Unable to display preview. Download preview PDF.
- Richard P. Gabriel. Performance and Evaluation of Lisp Systems. Computer Systems Series, MIT Press, Cambridge, Massachusetts, 1985.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501–538, October 1985.Google Scholar
- Joseph S. Weening. Parallel execution of Lisp programs. Technical Report STANCS-89-1265, Stanford University, Stanford, California, June 1989.Google Scholar