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

Bevan, D. I.; Burn, G. L.; Karia, R. J. and Robson, J. D. (1989). Principles for the design of a distributed memory architecture for parallel graph reduction. The Computer Journal, 32(5) pp. 461–469.

DOI: https://doi.org/10.1093/comjnl/32.5.461

URL: http://comjnl.oxfordjournals.org/content/32/5/461....

Abstract

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.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI