GAML: a Parallel Implementation of Lazy ML
@inproceedings{Maranget1991GAMLAP, title={GAML: a Parallel Implementation of Lazy ML}, author={Luc Maranget}, booktitle={FPCA}, year={1991} }
We present a new parallel implementation of lazy ML. Our scheme is a direct extension of the G-machine-based implementation of lazy ML. Parallelism is introduced by fork annotations inserted by the programmer. We discuss the interference of such user annotations with strictness annotations generated by our compiler. The system has been implemented on a Sequent Balance computer. We also address the main practical issues involved, including stack and heap management.Â
Topics from this paper
23 Citations
Fast parallel implementation of lazy languages—the EQUALS experience
- Computer Science
- LFP '92
- 1992
- 22
- PDF
Experience with a clustered parallel reduction machine
- Computer Science
- Future Gener. Comput. Syst.
- 1993
- 3
- PDF
References
SHOWING 1-10 OF 21 REFERENCES
A semantic model of reference counting and its abstraction (detailed summary)
- Computer Science
- LFP '86
- 1986
- 180
- PDF
On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications
- Computer Science
- POPL '90
- 1989
- 124
- PDF
Compiling pattern matching by term decomposition
- Computer Science
- LISP and Functional Programming
- 1990
- 44
- PDF
Compiling Lazy Functional Languages Part II, Ph
- D. Thesis, Chalmers Uni- versity of Technology,
- 1987