Murthy, PVR and Rajaraman, V (1994) Implementation of Speculative Parallelism in Functional Languages. In: IEEE Transactions on Parallel and Distributed Systems, 5 (11). pp. 1197-1205.
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.
|Item Type:||Journal Article|
|Additional Information:||Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||Conservative parallelism;Speculative parallelism;Lazy evaluation;Branch speculation;Argument speculation; Strictness analysis|
|Department/Centre:||Division of Information Sciences > Supercomputer Education & Research Centre|
|Date Deposited:||22 Aug 2008|
|Last Modified:||19 Sep 2010 04:26|
Actions (login required)