Execution of OPS5 production systems on a massively parallel machine

Journal Article · Sun Jun 01 00:00:00 EDT 1986 · J. Parallel Distrib. Comput.; (United States)

DOI:https://doi.org/10.1016/0743-7315(86)90006-7· OSTI ID:6471988

Hillyer, B K; Shaw, D E

In this paper, the authors describe an algorithm for executing production systems expressed in the OPS5 language on a massively parallel multiple-SIMD machine called NON-VON, portions of which are currently under construction at Columbia University. The algorithm, a parallel adaptation of Forgy's Rete Match, has been implemented and tested on an instruction-level simulator. They present a detailed performance analysis, based on the implemented code, for the averaged characteristics of six production systems having an average of 910 inference rules each. The analysis predicts an execution rate of more than 850 production firings per second using hardware comparable in cost to a VAX 11/780. By way of comparison, a LISP-based OPS5 interpreter running on a VAX 11/780 typically fires 1 to 5 rules per second, while a Bliss-based interpreter executes 5 to 12 rules per second.

• Research Organization: Dept. of Computer Science, Columbia Univ., New York, NY
• OSTI ID: 6471988
• Journal Information: J. Parallel Distrib. Comput.; (United States), Vol. 3:2
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ARTIFICIAL INTELLIGENCE
EXPERT SYSTEMS
EXECUTIVE CODES
ALGORITHMS
PARALLEL PROCESSING
PROGRAMMING LANGUAGES
TRANSLATORS
SUPERCOMPUTERS
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
COST
DEC COMPUTERS
LISP
PERFORMANCE
SIMULATORS
TIME DEPENDENCE
ANALOG SYSTEMS
COMPUTER CODES
COMPUTERS
DIGITAL COMPUTERS
FUNCTIONAL MODELS
MATHEMATICAL LOGIC
PROGRAMMING
990210* - Supercomputers- (1987-1989)