The connection machine
DADO: a tree-structured architecture for artificial intelligence computation
Annual review of computer science vol. 1, 1986
TREAT: a new and efficient match algorithm for AI production systems
TREAT: a new and efficient match algorithm for AI production systems
Implementing large production systems in a DBMS environment: concepts and algorithms
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Okies: a troubleshooter in the factory
IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
PAMELA: a rule-based AI language for process-control applications
IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
Efficient Matching Algorithms for the SOARIOPSS Production System
Efficient Matching Algorithms for the SOARIOPSS Production System
On the efficient implementation of production systems.
On the efficient implementation of production systems.
Parallelism in production systems
Parallelism in production systems
A methodology for programming production systems and its implications on parallelism
A methodology for programming production systems and its implications on parallelism
Table-driven rules in expert systems
ACM SIGART Bulletin
A case study of Venus and a declarative basis for rule modules
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Optimization of Rule-Based Systems Using State Space Graphs
IEEE Transactions on Knowledge and Data Engineering
R++: Adding Path-Based Rules to C++
IEEE Transactions on Knowledge and Data Engineering
A Graph-Based Approach for Timing Analysis and Refinement of OPS5 Knowledge-Based Systems
IEEE Transactions on Knowledge and Data Engineering
Optimizing Real-Time Equational Rule-Based Systems
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Rule-based systems have been hypothesized to contain only minimal parallelism. However, techniques to extract more parallelism from existing systems are being investigated. Among these methods, it is desirable to find those which balance the work being performed in parallel evenly among the rules, while decreasing the amount of work being performed sequentially in each cycle. The automatic transformation of creating constrained copies of culprit rules accomplishes both of the above goals. Rule-based systems are plagued by occasional rules which slow slow down the entire execution. These culprit rules require much more processing than others, causing other processors to idle while they continue to match. By creating constrained copies of culprit rules and distributing them to their own processors, more parallelism is achieved, as evidenced by increased speed up. This effect is shown to be specific to rule-based systems with certain characteristics. These characteristics are identified as being common within an important class of rule-based systems: expert database systems.