Share Email Print

Proceedings Paper

Parallelism In Rule-Based Systems
Author(s): Arvind Sabharwal; S. Sitharama Iyengar; G. de Saussure; C. R Weisbin
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Rule-based systems, which have proven to be extremely useful for several Artificial Intelligence and Expert Systems applications, currently face severe limitations due to the slow speed of their execution. To achieve the desired speed-up, this paper addresses the problem of parallelization of production systems and explores the various architectural and algorithmic possibilities. The inherent sources of parallelism in the production system structure are analyzed and the trade-offs, limitations and feasibility of exploitation of these sources of parallelism are presented. Based on this analysis, we propose a dedicated, coarse-grained, n-ary tree multiprocessor architecture for the parallel implementation of rule-based systems and then present algorithms for partitioning of rules in this architecture.

Paper Details

Date Published: 29 March 1988
PDF: 13 pages
Proc. SPIE 0937, Applications of Artificial Intelligence VI, (29 March 1988); doi: 10.1117/12.946995
Show Author Affiliations
Arvind Sabharwal, Louisiana State University (United States)
S. Sitharama Iyengar, Louisiana State University (United States)
G. de Saussure, Oak Ridge National Laboratory (United States)
C. R Weisbin, Oak Ridge National Laboratory (United States)

Published in SPIE Proceedings Vol. 0937:
Applications of Artificial Intelligence VI
Mohan M. Trivedi, Editor(s)

© SPIE. Terms of Use
Back to Top