High-performance parallel graph reduction
- Simon L Peyton JonesAffiliated withDepartment of Computer Science, University College London
- , Chris ClackAffiliated withDepartment of Computer Science, University College London
- , Jon SalkildAffiliated withDepartment of Computer Science, University College London
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.
•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.
- High-performance parallel graph reduction
- Book Title
- PARLE '89 Parallel Architectures and Languages Europe
- Book Subtitle
- Volume I: Parallel Architectures Eindhoven, The Netherlands, June 12–16, 1989 Proceedings
- pp 193-206
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.