Parallel Combinator Reduction: Some Performance Bounds

Authors:
M. S. Joy;T. H. Axford
Affiliations:
-;-
Venue:
Parallel Combinator Reduction: Some Performance Bounds
Year:
1992

Citing 0
Cited 2

A provably time-efficient parallel implementation of full speculation

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A provably time-efficient parallel implementation of full speculation

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallel graph reduction machine simulator is described. This performs combinator reduction and can simulate various different parallel reduction strategies. A number of functional programs are examined, and experimental results presented comparing the amount of parallelism obtainable using explicit divide-and-conquer with the maximum amount of parallelism available in the programs.