Principles for the design of a distributed memory architecture for parallel graph reduction

D I Bevan, G. L. Burn, R. J. Karia, J. D. Robson

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


Many models for the parallel reduction of lazy functional languages have been proposed in the literature. The one we have chosen to implement is based on evaluation transformers. An evaluation transformer says how much evaluation can be done to an argument expression in a function application, given the amount of evaluation that can be done to the application. Rather than just selecting a distributed memory architecture and trying to support parallel graph reduction, we investigate the implications of a minimally specified distributed memory architecture for parallel graph reduction. The results of the investigation are incorporated into an abstract machine which is able to support the communication and synchronisation needs of the parallel reduction model on a distributed memory architecture. Certain flags are needed on the nodes in the program graph in order to support the model. These are motivated and described.
Original languageEnglish
Pages (from-to)461-469
Number of pages9
JournalComputer Journal
Issue number5
Publication statusPublished - 1 Jan 1989


  • distributed memory architecture
  • lazy functional languages
  • parallel graph reduction


Dive into the research topics of 'Principles for the design of a distributed memory architecture for parallel graph reduction'. Together they form a unique fingerprint.

Cite this