Using Queueing Theory for Analytical Performance Evaluation of aMultiple Functional

نویسندگان

  • Nelson Amaral
  • Joydeep Ghosh
چکیده

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 algorithm 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 innnite 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].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantitative System Evaluation with Java Modeling Tools (Tutorial Paper)

Java Modelling Tools (JMT) is a suite of open source applications for performance evaluation and workload characterization of computer and communication systems based on queueing networks. JMT includes tools for workload characterization (JWAT), solution of queueing networks with analytical algorithms (JMVA), simulation of general-purpose queueing models (JSIM), bottleneck identification (JABA)...

متن کامل

PH/PH/1 Queueing Models in Mathematica for Performance Evaluation

⎯A review of queueing applications indicates that many researchers have intelligently adapted its theoretical results to develop an easy and effective analytical tool that can be applied to manufacturing system planning. In particular, the PH/PH/1 distribution has been studied extensively for GI/G/1 queue models. We present Mathematica programs that calculate algebraically the probability distr...

متن کامل

Performance evaluation for DRED discrete-time queueing network analytical model

Due to the rapid development in computer networks, congestion becomes a critical issue. Congestion usually occurs when the connection demands on network resources, i.e. buffer spaces, exceed the available ones. We propose in this paper a new discrete-time queueing network analytical model based on dynamic random early drop (DRED) algorithm to control the congestion in early stages. We apply our...

متن کامل

Stationary Analysis of an M/M/1 Driven Fluid Queue Subject to Catastrophes and Subsequent Repair

Fluid models are appropriate in the field of telecommunication for modelling the network traffic where individual units of arrival have less impact on the performance of the network. Such models characterize the traffic as a continuous stream with a parameterized flow rate. For practical design and performance evaluation, it is essential to obtain information about the buffer occupancy distribu...

متن کامل

Using Satisficing Game Theory for Performance Evaluation of Banks’ Branches (Case Study in the Mellat Bank)

Due to its role in the identification of inefficient branches and deciding the consistency of their activities, evaluating the performance of a bankchr('39')s branches is one of the most important decisions in the field of development and regulation of branch network. In this paper, the satisfactory functions based on game theory strategies have been utilized in order to evaluate the individual...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995