Advertisement

Overview of a parallel reduction machine project II

Project 415 Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 365)

Abstract

We describe some of the key results in a project to implement lazy functional languages on parallel architectures. The project has taken a language-first approach, letting the language drive the architecture, rather than choosing an architecture and trying to define a language which is modelled on the architecture. We discuss the parallel implementation model, abstract machines to support the model, a distributed storage management system with low overheads, and a demonstration implementation on a transputer network. Throughout the project, we have found functional languages to be a useful tool for conducting some of our experiments.

Keywords

Parallel Machine Parallel Architecture Garbage Collection Functional Program Abstract Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1988]
    3L Ltd., Livingstone, Scotland. Parallel C User Guide, 1988.Google Scholar
  2. [1987]
    A.W. Appel. Garbage collection can be faster than stack allocation. Information Processing Letters, 25(4):275–279, 1987.CrossRefGoogle Scholar
  3. [1987]
    L. Augustsson. Compiling Lazy Functional Languages, Part II. Doctoral thesis, Chalmers Tekniska Högskola, Göteborg, Sweden, 1987.Google Scholar
  4. [1987]
    D.I. Bevan. Distributed garbage collection using reference counting. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, PARLE Parallel Architectures and Languages Europe, volume 2, pages 176–187, Eindhoven, The Netherlands, June 1987.Google Scholar
  5. [1989]
    D.I. Bevan, G.L. Burn, R.J. Karia, and J.D. Robson. Design principles of a distributed memory architecture for parallel graph reduction. The Computer Journal, 1989.Google Scholar
  6. [1988]
    A. Bloss, P. Hudak, and J. Young. Code optimisations for lazy evaluation. In Proceedings of the Workshop on the Implementation of Lazy Functional Languages, Aspenäs, Göteborg, Sweden, 5–8, September 1988.Google Scholar
  7. [1987]
    P.G. Bosco, C. Checci, and C. Moiso. Feasible computational models for logic plus functional programming integration. Deliverable D3, Centro Studi E Laboratori Telecomunicazioni, Torino, Italy, October 1987.Google Scholar
  8. [1987a]
    G. L. Burn. Evaluation transformers — A model for the parallel evaluation of functional languages (extended abstract). In G. Kahn, editor, Proceedings of the Functional Programming Languages and Computer Architecture Conference, pages 446–470. Springer-Verlag, September 1987.Google Scholar
  9. [1987b]
    G.L. Burn. Abstract Interpretation and the Parallel Evaluation of Functional Languages. Doctoral thesis, Imperial College, University of London, March 1987.Google Scholar
  10. [1988a]
    G.L. Burn. Developing a distributed memory architecture for parallel graph reduction. In Proceedings of CONPAR 88, Manchester, United Kingdom, 12–16 September 1988.Google Scholar
  11. [1988b]
    G.L. Burn. A shared memory parallel G-machine based on the evaluation transformer model of computation. In Proceedings of the Workshop on the Implementation of Lazy Functional Languages, Aspenäs, Göteborg, Sweden, 5–8, September 1988.Google Scholar
  12. [1988]
    G.L. Burn, S.L. Peyton Jones, and J.D. Robson. The spineless G-machine. In Proceedings of the 1988 ACM Symposium on Lisp and Functional Programming, Snowbird, Utah, 1988.Google Scholar
  13. [1982]
    F.W. Burton and M.R. Sleep. Executing functional programs on a virtual tree of processors. In Proceedings of the First Conference on Functional Programming and Computer Architecture, pages 187–194, Portsmouth, New Hampshire, October 1982.Google Scholar
  14. [1987]
    J. Fairbairn and S. Wray. TIM: A simple, lazy abstract machine to execute supercombinators. In G. Kahn, editor, Proceedings of the Functional Programming Languages and Computer Architecture Conference, pages 34–45. Springer-Verlag, September 1987.Google Scholar
  15. [1988]
    B.F. Goldberg. Multiprocessor Execution of Functional Programs. Doctoral thesis, Yale University, Department of Computer Science, April 1988.Google Scholar
  16. [1988]
    P.H. Hartel. A comparative study of four garbage collection algorithms. Technical report, Computing Science Department, University of Amsterdam, February 1988.Google Scholar
  17. [1983]
    T. Johnsson. The G-machine. An abstract machine for graph reduction. In Declarative Programming Workshop, pages 1–20, University College London, April 1983.Google Scholar
  18. [1987]
    T. Johnsson. Compiling Lazy Functional Languages. Doctoral thesis, Chalmers Tekniska Högskola, Göteborg, Sweden, 1987.Google Scholar
  19. [1988]
    T. Johnsson. The v, g-machine: An abstract machine for parallel graph reduction. In Proceedings of the Workshop on the Implementation of Lazy Functional Languages, Aspenäs, Göteborg, Sweden, 5–8, September 1988.Google Scholar
  20. [1987]
    R.J. Karia. An Investigation of Combinator Reduction on Multiprocessor Architectures. Doctoral thesis, Westfield College, University of London, January 1987.Google Scholar
  21. [1989]
    H. Kingdon, D.R. Lester, and G.L. Burn. The HDG-Machine: A highly distributed graph reducer for a transputer network. In Submitted to: Conference on Functional Programming Languages and Computer Architecture, London, U.K., 11–13 September 1989. ACM SIGPLAN Notices.Google Scholar
  22. [1989a]
    D.R. Lester. An efficient distributed garbage collection algorithm. In PARLE Parallel Architectures and Languages Europe. Springer-Verlag, 1989.Google Scholar
  23. [1989b]
    D.R. Lester. Stacklessness: Compiling recursion for a distributed architecture. In Submitted to: Conference on Functional Programming Languages and Computer Architecture, London, U.K., 11–13 September 1989.Google Scholar
  24. [1989]
    D.R. Lester and G.L. Burn. An executable specification of the HDG-Machine. In Workshop on Massive Parallelism: Hardware, Programming and Applications, Italy, 9–15 October 1989.Google Scholar
  25. [1988]
    R. Loogen, H. Kuchen, K. Indermark, and W. Damm. Distributed implementation of programmed graph reduction. In Proceedings of the Workshop on the Implementation of Lazy Functional Languages, Aspenäs, Göteborg, Sweden, 5–8, September 1988.Google Scholar
  26. [1989]
    S.L. Peyton Jones. Parallel implementations of functional programming languages. The Computer Journal, April 1989.Google Scholar
  27. [1989]
    S.L. Peyton Jones and J. Salkild. The Spineles Tagless G-Machine. Submitted to the Conference on Functional Programming Languages and Computer Architecture, London, September 1989, March 1989.Google Scholar
  28. [1987]
    S.L. Peyton Jones, C. Clack, J. Salkild, and M. Hardie. GRIP—a high-performance architecture for parallel graph reduction. In G. Kahn, editor, Proceedings of the Functional Programming Languages and Computer Architecture Conference, pages 98–112. Springer-Verlag, September 1987.Google Scholar
  29. [1986]
    J. Sargeant. Load balancing, locality and parallelism control in fine-grain parallel machines. Technical Report Series UMCS-86-11-5, Department of Computer Science, University of Manchester, Manchester M13 9PL, England, November 1986.Google Scholar
  30. [1986]
    D.A. Turner. An overview of Miranda. SIGPLAN Notices, December 1986.Google Scholar
  31. [1988]
    L.G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. North Holland, Amsterdam, The Netherlands, 1988.Google Scholar
  32. [1987]
    P. Wadler and R. J. M. Hughes. Projections for strictness analysis. In G. Kahn, editor, Proceedings of the Functional Programming Languages and Computer Architecture Conference, pages 385–407. Springer-Verlag, September 1987.Google Scholar
  33. [1987a]
    P. Watson and I. Watson. An efficient garbage collection scheme for parallel computer architectures. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, PARLE Parallel Architectures and Languages Europe, volume 2, pages 432–443, Eindhoven, The Netherlands, June 1987.Google Scholar
  34. [1987b]
    P. Watson and I. Watson. Evaluating functional programs on the FLAGSHIP machine. In G. Kahn, editor, Proceedings of the Functional Programming Languages and Computer Architecture Conference, pages 80–97. Springer-Verlag, September 1987.Google Scholar
  35. [1987]
    I. Watson, J. Sargeant, P. Watson, and V. Woods. Flagship computational models and machine architecture. ICL Technical Journal, 5:555–574, May 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • GL Burn
    • 1
  1. 1.GEC Hirst Research CentreWembleyUnited Kingdom

Personalised recommendations