The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1994 vol.5)
pp: 1197-1205
ABSTRACT
<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 TERMS
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
CITATION
P.V.R. Murthy, V. Rajaraman, "Implementation of Speculative Parallelism in Functional Languages", IEEE Transactions on Parallel & Distributed Systems, vol.5, no. 11, pp. 1197-1205, November 1994, doi:10.1109/71.329669
51 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool