Markovian queueing network models for performance analysis of a single-bus multiprocessor system
- 1 July 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 39 (7) , 975-980
- https://doi.org/10.1109/12.55702
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
This publication has 15 references indexed in Scilit:
- A Closed-Form Solution for the Perfornance Analysis of Multiple-Bus Multiprocessor SystemsIEEE Transactions on Computers, 1984
- Comparative Performance Analysis of Single Bus Multiprocessor ArchitecturesIEEE Transactions on Computers, 1982
- Markov Models for Multiple Bus Multiprocessor SystemsIEEE Transactions on Computers, 1982
- The Operational Analysis of Queueing Network ModelsACM Computing Surveys, 1978
- A General Model for Memory Interference in MultiprocessorsIEEE Transactions on Computers, 1977
- Cm*Published by Association for Computing Machinery (ACM) ,1977
- Interference in multiprocessor computer systems with interleaved memoryCommunications of the ACM, 1976
- Solution of Queuing Problems by a Recursive TechniqueIBM Journal of Research and Development, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Closed Queuing Systems with Exponential ServersOperations Research, 1967