Programmed graph reduction has been shown to be an efficient implementation technique for lazy functional languages on sequential machines. Considering programmed graph reduction as a generalization of conventional environment-based implementations where the activation records are allocated in a graph instead of on a stack it becomes very easy to use this technique for the execution of functional programs in a parallel machine with distributed memory. We describe in this paper the realization of programmed graph reduction in PAM — a parallel abstract machine with distributed memory. Results of our implementation of PAM on an Occam-Transputersystem are given.
CITATION STYLE
Loogen, R., Kuchen, H., Indermark, K., & Damm, W. (1989). Distributed implementation of programmed graph reduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 365 LNCS, pp. 136–157). Springer Verlag. https://doi.org/10.1007/3540512845_37
Mendeley helps you to discover research relevant for your work.