By Topic

Speculative parallel graph reduction of lambda calculus to deferred substitution form

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yong-Hack Lee ; Dept. of Comput. Eng., Dongguk Univ., Seoul, South Korea ; Suh-Hyun Cheon

In a parallel graph reduction system, speculative evaluation can increase parallelism but waste machine resources by evaluating expression which may eventually be discarded. When a speculative task reduces a lambda expression to WHNF (Weak Head Normal Form), substitution can lead to unbounded growth of the graph size and require copy operation. This speculative task may be unnecessary. In that case the performance is affected by the overheads to terminate all tasks to be propagated from a speculative task and to refresh the memory cells to be allocated for copy operation. We propose a lambda form called DSF (Deferred Substitution Form) which substitution is deferred until a mandatory task will evaluate substitution. In a speculative task to DSF, since there is no substitution. It cannot grow the graph size and require copy operation. Therefore the overhead can be decreased when a expression reduced to DSF is eventually unnecessary. In addition we propose an evaluation model for DSF to increase the parallelism

Published in:

Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on

Date of Conference:

10-12 Dec 1997