Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Using Queueing Theory for Analytical Performance Evaluation of a Multiple Functional Unit Rete Network
 

Summary: Using Queueing Theory for Analytical Performance Evaluation of a
Multiple Functional Unit Rete Network
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
The matching phase is believed to require as much as 90 percent of the execution time of a
production system. The Rete Network is the most well known and broadly used matching algo­
rithm for production system. This paper proposes a new concurrent organization with multiple
functional units for execution of Rete Networks. We address the lack of theoretical studies of
matching performance in production systems by presenting an analytical model to predict the
Rete Network performance. This model is based on infinite Markov chain and queueing theory
and successfully estimates the average number of tokens in a system with m functional units.
Little's result allows the use of this estimate to predict the performance improvement when more
functional units are added to the system. Finally, we report the predictions of the model for the
Rete Network used in a parallel architecture proposed in a related work [1].
1 Introduction
Production systems provide an efficient paradigm to construct knowledge base systems. However,

  

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

 

Collections: Computer Technologies and Information Sciences