Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Serializability Improves Parallel Execution of Production System Jos'e Nelson Amaral \Lambda Joydeep Ghosh
 

Summary: Serializability Improves Parallel Execution of Production System
Jos'e Nelson Amaral \Lambda Joydeep Ghosh
(amaral@madona.pucrs.br) (ghosh@pine.ece.utexas.edu)
Departamento de Eletr“onica Dept. of Electr. and Comp. Engineering
Pontif'icia Universidade Cat'olica do RGS The University of Texas at Austin
90619­900 ­ Porto Alegre, RS Austin, Texas 78712
Abstract
This paper presents a new production system architecture that uses serializability as
a correctness criterion to select a set of productions to be executed in parallel. The use
of serializability eliminates global synchronization. This architecture takes advantage of
modern associative memory devices to allow parallel production firing, concurrent matching,
and overlap among matching, selection, and firing of productions. A comprehensive event­
driven simulator is used to evaluate the scaling properties of the new architecture and to
compare it with a parallel architecture using global synchronization before every production
firing. Our results indicate that the combination of serializability and associative memories
can achieve substantial improvements in speed with a very modest increase in hardware cost.
1 Introduction
Attempts to speed up Production Systems (PS) date back to 1979 when Forgy created the Rete
network, a state saving algorithm to speed up the matching phase of PS [4]. Following a 1986
study by Gupta, which indicated that a significant portion of the processing time in a Rete­based

  

Source: Amaral, José Nelson - Department of Computing Science, University of Alberta

 

Collections: Computer Technologies and Information Sciences