Bevan, D. I.; Burn, G. L.; Karia, R. J. and Robson, J. D.
|DOI (Digital Object Identifier) Link:||http://doi.org/10.1093/comjnl/32.5.461|
|Google Scholar:||Look up in Google Scholar|
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.
|Item Type:||Journal Article|
|Copyright Holders:||1989 Oxford University Press|
|Academic Unit/Department:||Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
|Depositing User:||David Bevan|
|Date Deposited:||31 May 2012 08:56|
|Last Modified:||04 Oct 2016 11:17|
|Share this page:|