Parallel Evaluation of Linearly Recursive Rules using a Shared - Nothing Parallel Architecture


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 12, pp. 3069-3077, Dec. 1997
10.3745/KIPSTE.1997.4.12.3069,   PDF Download:

Abstract

This paper is concerned with a new paradigm for parallel evaluation of linear recursion rules which contain transitive dependency in a shared-nothing parallel architecture. For parallel evaluation of rules, we consider a shared-nothing parallel architecture that consists of a set of nodes a message passing network to these nodes. An evaluation of normalized rules is a computation of the proof-theoretic meaning of a collection of rules. We shall here define normalized recursion rules which contain transitive dependency, present an equivalent expression for the rule, propose a paradigm for parallel evaluation of normalized rule based on the equivalent expression using join, partition, and transitive closure operations, and analyze response-time complexity.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
C. W. Hyun and K. H. Joon, "Parallel Evaluation of Linearly Recursive Rules using a Shared - Nothing Parallel Architecture," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 12, pp. 3069-3077, 1997. DOI: 10.3745/KIPSTE.1997.4.12.3069.

[ACM Style]
Cho Woo Hyun and Kim Hang Joon. 1997. Parallel Evaluation of Linearly Recursive Rules using a Shared - Nothing Parallel Architecture. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 12, (1997), 3069-3077. DOI: 10.3745/KIPSTE.1997.4.12.3069.