Title :
Implementation of speculative parallelism in functional languages
Author :
Murthy, P.V.R. ; Rajaraman, V.
Author_Institution :
Supercomput. Educ. & Res. Centre, Indian Inst. of Sci., Bangalore, India
fDate :
11/1/1994 12:00:00 AM
Abstract :
A compile-time analysis technique is developed to derive the probability with which a user-defined function or a supercombinator requires each one of its arguments. This provides a basis for identifying useful speculative parallelism in a program. The performance of speculative evaluation is compared with that of lazy evaluation, and the necessary conditions under which speculative evaluation performs better are identified
Keywords :
functional programming; parallel languages; probability; argument speculation; branch speculation; compile-time analysis technique; conservative parallelism; functional languages; lazy evaluation; performance; probability; speculative evaluation; speculative parallelism; strictness analysis; supercombinator; user-defined function; Availability; Closed-form solution; Concurrent computing; Parallel processing; Performance evaluation; Processor scheduling; Runtime; Supercomputers;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
