(class1) (removeclass2)) ~ rul ruleB (class3) ruleA . 4. Selection Algorithm 43 onditions Paired-role conditions All-rule conditions Compile-time analysis (1) (Fig. 2(a)) (a) interference (b) interference (c) safe (a) interference (b) interference (c) safe Compile-time analysis (2) (Fig. 2 (b)) (a) interference (b) interference (c) safe (a) safe (b) interference (c) safe Run-time analysis (Fig.
The value of Cost(s) is reduced based on this prediction: the cost is recalculated Chapter 1. Production System Performance 18 by dividing the original cost by the number of rules which can share the node. 2. When optimizing each rule, sharable join structures, which have been already created during the optimization of other rules, are registered in the join-list of the rule as pre-calculated join structures. This time, costs of those two-input nodes are set to 0 because no cost is required to share existing nodes.
Parallel, Distributed and Multiagent Production Systems by Toru Ishida (auth.)
by Kevin
4.1