Abstract
We have described the work that has been carried out in our Subproject on functional programming architectures. Theoretical work in detecting parallelism allows for a scheme to perform safe parallel evaluation of functional languages. Experiences with COBWEB have indicated its weak points and led to the identification of some of the desired features of a multiprocessor system to support parallel graph reduction.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
Aubusson R C and Catt I, Wafer Scale Integration — A Fault Tolerant Procedure, IEEE Journal of Solid State Circuits, Vol Sc 13 No 3.
Bevan D I, Garbage Collection on COBWEB, Private Communication.
Burn G L, Abstract Interpretation and the Parallel Evaluation of Functional Programs Forthcoming Phd thesis, Imperial College.
Burton F W and Sleep M R, Executing Functional Programs on a Virtual tree of Processors, Proceedings of the ACM Conference on Functional Programming Languages and Computer Architectures, New Hampshire, Oct 1981.
Cardelli L, Compiling a Functional Language, 1984 ACM Conference on Lisp and Functional Programming, Austin, Texas.
Darlington J and Reeve M, ALICE — A Multiprocessor Reduction Machine for the Parallel Evaluation of Applicative Languages, Proceedings of the ACM Conference on Functional Programming Languages and Computer Architectures, New Hampshire, Oct 1981.
Hankin C L, Shute M J, Osmon P E, COBWEB, A Combinator Reduction Architecture, 1985 Conference on Functional Programming and Computer Architecture, Nancy, France (Springer Verlag LNCS 201).
Hankin C L, Burn G L, and Peyton Jones S L, A Safe Approach to Parallelism Combinator Reduction, Proceedings ESOP 86 (European Symposium on Programming), Saarbrucken, W Germany, March 1986, Springer Verlag LNCS 213.
Henderson P, Functional Programming — Application and Implementation, Englewood Cliffs, NJ, Prentice Hall 1980.
Hudak P and Goldberg B, Distributed Execution of Functional Programs using Serial Combinators, IEEE Trans on Computers, Vol C34, No 10, Oct 1985.
Hughes R J M, The Design and Implementation of Programming Languages, Oxford University Technical Monograph PRG-40.
Keller R M and Lin F C H, Simulated performance of a reduction based multiprocessor, IEEE Computer, Vol 17, July 1982.
Mago G, A Network of Microprocessors to Execute Reduction Languages, Parts 1 and 2, International Journal of Computer and Information Sciences 8 (1979).
Peyton Jones S L, Clack C, Salkild J, GRIP — A parallel graph reduction machine, Dept of Computer Science, University College, London, Nov 1985.
Shute M J and Osmon P E, COBWEB — A reduction architecture, Workshop on Wafer Scale Integration, July 1985, University of Southampton.
Stoye W, The SKIM II Microprogrammer's Guide, Cambridge University Computer Laboratory, Technical Note 1983.
Swan R J, Fuller S H and Siewiorek D P, Cm* — A Modular Multimicroprocessor, Proceedings of AFIPS NCC 46, June 1977
Turner D A, A New Implementation Technique for Applicative Languages, Software Practice and Experience Vol 9 1, Jan 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karia, R. (1987). Towards a parallel architecture for functional languages. In: Treleaven, P., Vanneschi, M. (eds) Future Parallel Computers. Lecture Notes in Computer Science, vol 272. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18203-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-18203-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18203-0
Online ISBN: 978-3-540-47806-5
eBook Packages: Springer Book Archive