Issue No. 11 - November (1994 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.329669
<p>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.</p>
Index Termsfunctional programming; parallel languages; probability; speculative parallelism; functional languages; compile-time analysis technique; probability; user-defined function; supercombinator; speculative evaluation; lazy evaluation; performance; conservative parallelism; branch speculation; argument speculation; strictness analysis
V. Rajaraman and P. Murthy, "Implementation of Speculative Parallelism in Functional Languages," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 1197-1205, 1994.