Bevan, D. I.; Burn, G. L. and Karia, R. J.
|DOI (Digital Object Identifier) Link:||http://doi.org/10.1007/3-540-17943-7|
|Google Scholar:||Look up in Google Scholar|
ESPRIT Project 415 has taken what are considered to be good programming language styles and is developing parallel architectures to support them. Here we describe the part of the project which is developing a distributed memory architecture for functional languages. Designing parallel architectures for evaluating functional languages presents many challenging problems. Firstly a model for the parallel reduction of such languages must be found. An abstract interpretation has been developed which leads to a parallel reduction model. It can be implemented in a compiler so that programs can automatically be annotated with parallelism information. The original COBWEB, a novel distributed memory architecture, is described, along with the conclusions we have drawn from our simulation work. We also briefly describe some of the architectural features of the architecture we are designing to support the parallel reduction model. Many programming languages including functional ones require automatic storage allocation which has to be garbage collected. We present another piece of work from our project which has resulted in the discovery of a distributed reference counting garbage collection algorithm which has very low overheads.
|Item Type:||Book Chapter|
|Copyright Holders:||1987 Springer-Verlag|
|Keywords:||parallel reduction; functional languages; concurrent distributed garbage collection; combinators; COBWEB; evaluation transformers|
|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:||29 May 2012 15:31|
|Last Modified:||04 Oct 2016 11:17|
|Share this page:|