Analyzing Parallel Executability of Production Systems

Toru Ishida

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The production system is one in which mutually independent rules communicate with each other through a common database aiming at the solution of a problem. Because of its nature, the production system seems to contain a larger potential parallelism than the procedural program. At present, however, only one rule succeeded in condition matching, is selected and executed, which prevents the full utilization of the parallelism. The aim of this paper is to realize a high‐speed execution of the production system by executing the rules in parallel as far as possible. First, a new execution model is proposed for the production system, where the rules succeeded in condition match are executed in parallel as far as possible. Then the data dependency graph for the production system is introduced, and a method is presented by which more than one rule is analyzed to determine whether or not they can be executed in parallel. A method is presented which applies the result of parallel executability analysis to the parallel execution of the rules on a parallel computer, or the execution scheduling of the rules on a sequential computer. A production system PLANET was constructed which can analyze a program by a parallel execution simulation, and the proposed method was evaluated. It was verified that four to eight rules can be executed in parallel in the range of programs used in the evaluation. By combining the result of this paper with the traditional parallel condition matching, it is expected that a further parallelism can be realized.

Original languageEnglish
Pages (from-to)85-97
Number of pages13
JournalSystems and Computers in Japan
Volume20
Issue number3
DOIs
Publication statusPublished - 1989 Jan 1
Externally publishedYes

Fingerprint

Production Systems
Parallelism
Dependency Graph
Data Dependency
Parallel Computers
Scheduling
High Speed
Evaluation
Range of data

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Analyzing Parallel Executability of Production Systems. / Ishida, Toru.

In: Systems and Computers in Japan, Vol. 20, No. 3, 01.01.1989, p. 85-97.

Research output: Contribution to journalArticle

Ishida, Toru. / Analyzing Parallel Executability of Production Systems. In: Systems and Computers in Japan. 1989 ; Vol. 20, No. 3. pp. 85-97.
@article{47105b782c6441909bd4187d6e8ba2ba,
title = "Analyzing Parallel Executability of Production Systems",
abstract = "The production system is one in which mutually independent rules communicate with each other through a common database aiming at the solution of a problem. Because of its nature, the production system seems to contain a larger potential parallelism than the procedural program. At present, however, only one rule succeeded in condition matching, is selected and executed, which prevents the full utilization of the parallelism. The aim of this paper is to realize a high‐speed execution of the production system by executing the rules in parallel as far as possible. First, a new execution model is proposed for the production system, where the rules succeeded in condition match are executed in parallel as far as possible. Then the data dependency graph for the production system is introduced, and a method is presented by which more than one rule is analyzed to determine whether or not they can be executed in parallel. A method is presented which applies the result of parallel executability analysis to the parallel execution of the rules on a parallel computer, or the execution scheduling of the rules on a sequential computer. A production system PLANET was constructed which can analyze a program by a parallel execution simulation, and the proposed method was evaluated. It was verified that four to eight rules can be executed in parallel in the range of programs used in the evaluation. By combining the result of this paper with the traditional parallel condition matching, it is expected that a further parallelism can be realized.",
author = "Toru Ishida",
year = "1989",
month = "1",
day = "1",
doi = "10.1002/scj.4690200309",
language = "English",
volume = "20",
pages = "85--97",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "3",

}

TY - JOUR

T1 - Analyzing Parallel Executability of Production Systems

AU - Ishida, Toru

PY - 1989/1/1

Y1 - 1989/1/1

N2 - The production system is one in which mutually independent rules communicate with each other through a common database aiming at the solution of a problem. Because of its nature, the production system seems to contain a larger potential parallelism than the procedural program. At present, however, only one rule succeeded in condition matching, is selected and executed, which prevents the full utilization of the parallelism. The aim of this paper is to realize a high‐speed execution of the production system by executing the rules in parallel as far as possible. First, a new execution model is proposed for the production system, where the rules succeeded in condition match are executed in parallel as far as possible. Then the data dependency graph for the production system is introduced, and a method is presented by which more than one rule is analyzed to determine whether or not they can be executed in parallel. A method is presented which applies the result of parallel executability analysis to the parallel execution of the rules on a parallel computer, or the execution scheduling of the rules on a sequential computer. A production system PLANET was constructed which can analyze a program by a parallel execution simulation, and the proposed method was evaluated. It was verified that four to eight rules can be executed in parallel in the range of programs used in the evaluation. By combining the result of this paper with the traditional parallel condition matching, it is expected that a further parallelism can be realized.

AB - The production system is one in which mutually independent rules communicate with each other through a common database aiming at the solution of a problem. Because of its nature, the production system seems to contain a larger potential parallelism than the procedural program. At present, however, only one rule succeeded in condition matching, is selected and executed, which prevents the full utilization of the parallelism. The aim of this paper is to realize a high‐speed execution of the production system by executing the rules in parallel as far as possible. First, a new execution model is proposed for the production system, where the rules succeeded in condition match are executed in parallel as far as possible. Then the data dependency graph for the production system is introduced, and a method is presented by which more than one rule is analyzed to determine whether or not they can be executed in parallel. A method is presented which applies the result of parallel executability analysis to the parallel execution of the rules on a parallel computer, or the execution scheduling of the rules on a sequential computer. A production system PLANET was constructed which can analyze a program by a parallel execution simulation, and the proposed method was evaluated. It was verified that four to eight rules can be executed in parallel in the range of programs used in the evaluation. By combining the result of this paper with the traditional parallel condition matching, it is expected that a further parallelism can be realized.

UR - http://www.scopus.com/inward/record.url?scp=0024629665&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024629665&partnerID=8YFLogxK

U2 - 10.1002/scj.4690200309

DO - 10.1002/scj.4690200309

M3 - Article

AN - SCOPUS:0024629665

VL - 20

SP - 85

EP - 97

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 3

ER -