RETE Algorithm

We focus on the partitioning of rules for parallel matching in a production system. Our approach, called PARTES, applies the man-cut technique t o a Dataflow Discrimination Network (DDN) that represents th? antecedents of the rules. Our goal is t o rnaxiinize sharing of memory nodes within a partition while minimizing duplication of nodes across partitions. We illustrate the technique using a cost model based on shared memory nodes defined in a DDN created by the R E T E algorithin. A generalization t o any other algorithm utilizing a DDN as straightforward. We provide a performance analysis to show the effectiveness of PARTES.