Shin Seung Cheol, Yoo Weon Hee

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 3, pp. 478-492, Apr. 1996
10.3745/KIPSTE.1996.3.3.478,   PDF Download:

Abstract

For parallel implementations of functional programs without concurrent primitives, the -calculus encodings have been introduced. A functional program may be transformed into a process network using process calculi by the -calculus encoding and the result of a program can be obtained by a deal of communication actions in it''s process network. But the -calculus encodings cause too many communication actions even in constant expressions. This paper shows the encoding for a combinator program without concurrency primitives which can combine the graph reduction and the process-net reduction using computable processes, ''chores''. A ''chores'' may have graph reduction functions for primitive operations of constants for which local graph reduction may be possible, and be encoded from a ''G-reducible'' subexpression which is obtained by an annotation and transformation for a combinator program, assuring that it does not include any combinator application. Also, we show that a process network with chores raises less communication actions than one without chores.

Statistics
Cite this article