JazzMatch: fine-grained parallel matching for large rule sets
Marco Richeldi, Jian Tan · 2002
JazzMatch, a parallel matching algorithm explicitly designed for secondary memory-based production systems, is presented. JazzMatch is a state-saving algorithm that performs incremental match. It exploits extremely fine-grained parallelism and optimizes the storage state by permitting the sharing of common conditions in the rules. JazzMatch is supported by a message passing parallel architecture. A cost and performance analysis of JazzMatch is provided, and the results are compared with those for other schemes in current literature.>