Distributed implementation of programmed graph reduction

  • Rita Loogen
  • Herbert Kuchen
  • Klaus Indermark
  • Werner Damm
Submitted Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 365)


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.


Evaluation Transformer Functional Program Graph Reduction Communication Unit Reduction Unit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bevan 87]
    D.Bevan: Distributed Garbage Collection Using Reference Counting, in: Lecture Notes in Computer Science, Vol. 259, Springer Verlag 1987.Google Scholar
  2. [Burn 87a]
    G.Burn: Evaluation Transformers — A Model for the Parallel Evaluation of Functional Languages, in: Lecture Notes in Computer Science 274, Springer Verlag 1987.Google Scholar
  3. [Burn 87b]
    G. Burn: Abstract Interpretation and the Parallel Evaluation of Functional Languages, Ph.D. Thesis, Imperial College, London 1987.Google Scholar
  4. [Burn 88a]
    G.Burn: Developing a Distributed Memory Architecture for Parallel Graph Reduction, CONPAR 88.Google Scholar
  5. [Burn 88b]
    G.Burn: personal communication at the Aspenäs Workshop on Implementation of Lazy Functional Languages, Göteborg, Sept. 1988.Google Scholar
  6. [Fairbairn/Wray 87]
    J.Fairbairn, S.Wray: TIM — A Simple Lazy Abstract Machine to Execute Supercombinators, in: Lecture Notes in Computer Science 274, Springer Verlag 1987.Google Scholar
  7. [Hudak/Goldberg 85]
    P.Hudak, B.Goldberg: Efficient Distributed Evaluation of Functional Programs Using Serial Combinators, IEEE Transactions on Computers, Vol. C-34, No. 10, October 85.Google Scholar
  8. [Johnsson 84]
    Th.Johnsson: Efficient Compilation of Lazy Evaluation, SIGPLAN Notices Vol. 19, No. 6, June 1984.Google Scholar
  9. [Johnsson 87]
    Th. Johnsson: Compiling Lazy Functional Languages, Ph.D. Thesis, Chalmers University of Technology, Göteborg 1987.Google Scholar
  10. [Loogen 87]
    R.Loogen: Design of a parallel programmable graph reduction machine with distributed memory, Aachener Informatik-Berichte Nr. 87-11.Google Scholar
  11. [Loogen 88]
    R.Loogen: Parallele Implementierung funktionaler Programmiersprachen, Dissertation (in german), RWTH Aachen, 1988.Google Scholar
  12. [Loogen,Kuchen et al. 89]
    R.Loogen, H.Kuchen, K.Indermark, W.Damm: Implementation of Functional Languages on Multiprocessor Systems, Aachener Informatik-Berichte 1989.Google Scholar
  13. [Myers 84]
    E.Myers: Efficient applicative data types, ACM Symp. on Principles of Programming Languages 1984, 66–75.Google Scholar
  14. [Raber,Remmel et al. 88]
    M.Raber, Th.Remmel, E.Hoffmann, D.Maurer, F.Müller, H.Oberhauser. R.Wilhelm: Compiled Graph Reduction on a Processor Network, GI/ITG Tagung Paderborn, 1988, Informatik-Fachberichte, Springer Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Rita Loogen
    • 1
  • Herbert Kuchen
    • 1
  • Klaus Indermark
    • 1
  • Werner Damm
    • 2
  1. 1.RWTH Aachen, Lehrstuhl für Informatik IIAachenWest Germany
  2. 2.FB InformatikUniversität OldenburgOldenburgWest Germany

Personalised recommendations