Distributed Implementation of Programmed Graph Reduction (1989)
| Venue: | Conf. on Parallel Architectures and Languages Europe 1989, LNCS 365 |
| Citations: | 17 - 1 self |
BibTeX
@INPROCEEDINGS{Loogen89distributedimplementation,
author = {Rita Loogen and Herbert Kuchen and Klaus Indermark and Werner Damm},
title = {Distributed Implementation of Programmed Graph Reduction},
booktitle = {Conf. on Parallel Architectures and Languages Europe 1989, LNCS 365},
year = {1989},
pages = {136--157},
publisher = {Springer Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1 Introduction The most important properties of lazy functional programs are their expressiveness which is due to the possibility to work with higher order functions and infinite data structures, their semantic simplicity which is due to their mathematical foundation and finally their implicit parallelism which is due to the Ch...
Citations
No citations identified.
