Markovian queueing network models for performance analysis of a single-bus multiprocessor system

Author

Önyüksel, Ibrahim H. ; Irani, Keki B.

Author_Institution

Dept. of Comput. Sci., Northern Illinois Univ., DeKalb, IL, USA

Volume

39

Issue

7

fYear

1990

fDate

7/1/1990 12:00:00 AM

Firstpage

975

Lastpage

980

Abstract

An exact solution for the performance analysis of a typical single-bus multiprocessor system is presented. The multiprocessor system is modeled by a Markovian queueing network. An r-stage hypoexponential distribution or an r-stage hyperexponential distribution is used to represent the nonexponential service times. Consequently, the equilibrium probabilities of two-dimensional Markov chains are expressed by simple recurrence relations. Processing efficiency is used as the primary measure of performance. To investigate the effects of different service time distributions on system performance, comparative results are obtained for a large set of input parameters. The numerical results illustrate that processing efficiency attains its maximum value for a constant (deterministic) service time; if service time of common memory is hypoexponentially distributed, then approximating the service time by an exponential distribution produces less than 6% error on the system performance

Keywords

Markov processes; multiprocessing systems; performance evaluation; queueing theory; Markovian queueing network models; equilibrium probabilities; hyperexponential distribution; performance analysis; r-stage hypoexponential distribution; recurrence relations; service time distributions; single-bus multiprocessor system; Costs; Exponential distribution; Mathematical model; Multiprocessing systems; Multiprocessor interconnection networks; Performance analysis; Proposals; Queueing analysis; Switches; System performance;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.55702

Filename

55702