High-performance parallel graph reduction

  • Simon L Peyton Jones
  • Chris Clack
  • Jon Salkild
Submitted Presentations

DOI: 10.1007/3540512845_40

Part of the Lecture Notes in Computer Science book series (LNCS, volume 365)
Cite this paper as:
Jones S.L.P., Clack C., Salkild J. (1989) High-performance parallel graph reduction. In: Odijk E., Rem M., Syre JC. (eds) PARLE '89 Parallel Architectures and Languages Europe. PARLE 1989. Lecture Notes in Computer Science, vol 365. Springer, Berlin, Heidelberg

Abstract

Parallel graph reduction is an attractive implementation for functional programming languages because of its simplicity and inherently distributed nature. This paper outlines some of the issues raised by parallel compiled graph reduction, and presents the approach we have adopted for our parallel machine, GRIP.

We concentrate on two main areas:
  • •Static and dynamic techniques to control the growth of parallelism, so as to provide enough parallelism of an appropriate granularity to keep the machine busy without swamping it.

  • •Dynamic techniques to exploit the memory hierarchy, so that frequently-referenced data is held near to the processor that references it.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Simon L Peyton Jones
    • 1
  • Chris Clack
    • 1
  • Jon Salkild
    • 1
  1. 1.Department of Computer ScienceUniversity College LondonLondonUnited Kingdom

Personalised recommendations