Implementation of Speculative Parallelism in Functional Languages

Authors:
P. V. R. Murthy;V. Rajaraman
Affiliations:
Indian Institute of Science, Bangalore, India;Indian Institute of Science, Bangalore, India
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 5
Cited 0

Parallel implementations of functional programming languages

The Computer Journal - Special issue on Lazy functional programming
Speculative computation in Multilisp

Proceedings of the US/Japan workshop on Parallel Lisp on Parallel Lisp: languages and systems
The four-stroke reduction engine

LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Mechanical program analysis

Communications of the ACM
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A compile-time analysis technique is developed to derive the probability with which auser-defined function or a supercombinator requires each one of its arguments. Thisprovides a basis for identifying useful speculative parallelism in a program. Theperformance of speculative evaluation is compared with that of lazy evaluation, and thenecessary conditions under which speculative evaluation performs better are identified.