This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Markovian Queueing Network Models for Performance Analysis of a Single-Bus Multiprocessor System
July 1990 (vol. 39 no. 7)
pp. 975-980

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.

[1] W. A. Wulf and C. G. Bell, "C.mmp--A multi-miniprocessor," inProc. AFIPS, 1972, pp. 765-777.
[2] D. P. Bhandarkar, "Analysis of memory interference in multiprocessors,"IEEE Trans. Comput., vol. C-24, pp. 897-908, Sept. 1975.
[3] F. S. Baskett and A. J. Smith, "Interference in multiprocessor computer systems with interleaved memory,"Commun. ACM, vol. 19, pp. 327-334, Jun. 1976.
[4] C. H. Hoogendoorn, "A general model for memory interference in multiprocessors,"IEEE Trans. Comput., vol. C-26, pp. 998-1005, Oct. 1977.
[5] D. W. Yen, J. H. Patel, and E. S. Davidson, "Memory interference in synchronous multiprocessor systems,"IEEE Trans. Comput., vol. C-31, pp. 1116-1121, Nov. 1982.
[6] R. J. Swanet al., "CM*--A modular multi-microprocessor," inProc. AFIPS, 1977, pp. 637-644.
[7] J. V. Levy, "Buses: The skeleton of computer structures," inComputer Engineering: A DEC View of Hardware System Design, C. G. Bell, J. C. Mudge, and J. E. McNamara, Eds., Digital Equipment Corp., 1978.
[8] F. Fung and H. C. Torng, "On the analysis of memory conflicts and bus contentions in a multiple-microprocessor system,"IEEE Trans. Comput., vol. C-28, pp. 28-37, Jan. 1979.
[9] A. Goyal and T. Agerwala, "Performance analysis of future shared storage systems,"IBM J. Res. Develop., vol. 28, pp. 95-108, Jan. 1984.
[10] M. Ajmone Marsan, G. Balbo, and G. Conte, "Comparative performance analysis of single-bus multiprocessor architectures,"IEEE Trans. Comput., vol. C-31, pp. 1179-1191, Dec. 1982.
[11] K. B. Irani and I. H.Önyüksel, "A closed-form solution for the performance analysis of multiple-bus multiprocessor systems,"IEEE Trans. Comput., vol. C-33, pp. 1004-1012, Nov. 1984.
[12] W. J. Gordon and G. F. Newell, "Closed queueing systems with exponential servers,"Oper. Res., vol. 15, pp. 254-265, 1967.
[13] F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, "Open, closed, and mixed networks of queues with different classes of customers,"J. ACM, vol. 22, no. 2, pp. 248-260, 1975.
[14] P. J. Denning and J. P. Buzen, "The operational analysis of queueing network models,"ACM Comput. Surveys, vol. 10, pp. 225-261, Sept. 1978.
[15] L. Takács,Introduction to the Theory of Queues. Greenwood Press, 1962.
[16] N. K. Jaiswal,Priority Queues. New York: Academic, 1968.
[17] A. O. Allen,Probability, Statistics, and Queuing Theory. New York: Academic, 1978.
[18] U. Herzog, L. Woo, and K. M. Chandy, "Solution of queueing problems by a recursive technique,"IBM J. Res. Develop., vol. 19, pp. 295-300, May 1975.
[19] M. Ajmone Marsen and M. Gerla, "Markov models for multiplebus multiprocessor systems,"IEEE Trans. Comput., vol. C-31, pp. 239-248, Mar. 1982.

Index Terms:
Markovian queueing network models; performance analysis; single-bus multiprocessor system; r-stage hypoexponential distribution; hyperexponential distribution; equilibrium probabilities; recurrence relations; service time distributions; Markov processes; multiprocessing systems; performance evaluation; queueing theory.
Citation:
I.H. Onyuksel, K.B. Irani, "Markovian Queueing Network Models for Performance Analysis of a Single-Bus Multiprocessor System," IEEE Transactions on Computers, vol. 39, no. 7, pp. 975-980, July 1990, doi:10.1109/12.55702
Usage of this product signifies your acceptance of the Terms of Use.