Ns2 project in adelaide
Ns2 project in Adelaidein the initial definition of PARULEL, we allow conditional expressions in the LHS of ns2 project in Adelaide metarules. These conditions evaluate arithmetic expressions containing values bound in the ns2 project in adelaide object level rule instances. In certain cases one may want a more expressive ns2 project in adelaide metarule that computes some arbitrary “aggregate” condition on its LHS that is ns2 project in Adelaide applied to a set of matching base rule instances. For example, one may choose to fire a set of rule instances if the number of those instances is greater than the number ns2 project in adelaide of instances generated by another distinct object level rule. We distinguish these two cases as “base” metarules and “aggregate” metarules. Each poses different problems ns2 project in Adelaide for metarule matching.
The initial PARADISER implementation uses a replicated database configuration where multiple processing sites are involved in rule evaluation. Each processing site has a distinct constrained version of the rule program. Metarule matching is complicated by the fact that instances at one site may need to be nmcommunicated to ns2 project in Adelaide another site in order for a metarule to be matched fully.
If we choose not to communicate instances and do all metalevel processing at each individual site, additional burden is ns2 project in Adelaide placed on the compile time distribution and reorganization subsystem, which is also responsible for load balancing of base rule evaluations the case of aggregate metarules, the point is moot; all instances might have to be comrnunicated to one site that computes ns2 project in Adelaide the aggregate function against the set of instances. Of course, it may be possible to compute the aggregate function in parallel among the sites if the function ns2 project in adelaide in question is associative mand commutative.