K. Morgan
ABSTRACT
The rule-based system has emerged as an important tool to developers of artificial intelligence programs. Because of the computational resources required to realize the MATCH-SELECT-EXECUTE cycle of rule-based systems, researchers have been trying to introduce parallelism into these systems for some time. We describe a new approach to parallel rule-based systems which exploits fine-grained hypercube hardware. The new algorithms for parallel rule matching and simultaneous execution of several rules at once are presented. Experimental results using a Connection Machine* implementation of BLITZ are presented.
- Forgy, 1982.C. L. Forgy, Rete: A Fast Algorithm for the Many Pattern / Many Object Pattern Matching Problem, Artificial Intelligence, 19: 17-37, 1982.Google Scholar
Digital Library
- Gupta, 1984.A. Gupta, Parallelism in Production Systems, Ph.D. Thesis, Carnegie Mellon University, Department of Computer Science, 1986. Google ScholarDigital Library
- Miranker, 1987.D. P. Miranker, TREAT: A Better Match Algorithm for AI Production Systems, Proceedings of AAAI-87, 42-47, i987. Google ScholarDigital Library
Index Terms
- Blitz: a rule-based system for massively parallel architectures
Recommendations
Parallel algorithms and architectures for rule-based systems
Special Issue: Proceedings of the 13th annual international symposium on Computer architecture (ISCA '86)Rule-based systems, on the surface, appear to be capable of exploiting large amounts of parallelism—it is possible to match each rule to the data memory in parallel. In practice, however, we show that the speed-up from parallelism is quite limited, less ...
Parallel algorithms and architectures for rule-based systems
ISCA '86: Proceedings of the 13th annual international symposium on Computer architectureRule-based systems, on the surface, appear to be capable of exploiting large amounts of parallelism—it is possible to match each rule to the data memory in parallel. In practice, however, we show that the speed-up from parallelism is quite limited, less ...
Comparisons and analysis of massively parallel SIMD architectures for parallel logic simulation
IPPS '92: Proceedings of the 6th International Parallel Processing SymposiumThis paper compares and analyzes massively parallel SIMD architectures as processing environments for parallel logic simulation. The CM-2 and the MP-1 are considered as target machines for the comparison. Detailed contrasts between the two parallel ...
Comments