
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
I.H. Onyuksel, K.B. Irani, "Markovian Queueing Network Models for Performance Analysis of a SingleBus Multiprocessor System," IEEE Transactions on Computers, vol. 39, no. 7, pp. 975980, July, 1990.  
BibTex  x  
@article{ 10.1109/12.55702, author = {I.H. Onyuksel and K.B. Irani}, title = {Markovian Queueing Network Models for Performance Analysis of a SingleBus Multiprocessor System}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {7}, issn = {00189340}, year = {1990}, pages = {975980}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.55702}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Markovian Queueing Network Models for Performance Analysis of a SingleBus Multiprocessor System IS  7 SN  00189340 SP975 EP980 EPD  975980 A1  I.H. Onyuksel, A1  K.B. Irani, PY  1990 KW  Markovian queueing network models; performance analysis; singlebus multiprocessor system; rstage hypoexponential distribution; hyperexponential distribution; equilibrium probabilities; recurrence relations; service time distributions; Markov processes; multiprocessing systems; performance evaluation; queueing theory. VL  39 JA  IEEE Transactions on Computers ER   
An exact solution for the performance analysis of a typical singlebus multiprocessor system is presented. The multiprocessor system is modeled by a Markovian queueing network. An rstage hypoexponential distribution or an rstage hyperexponential distribution is used to represent the nonexponential service times. Consequently, the equilibrium probabilities of twodimensional 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.mmpA multiminiprocessor," inProc. AFIPS, 1972, pp. 765777.
[2] D. P. Bhandarkar, "Analysis of memory interference in multiprocessors,"IEEE Trans. Comput., vol. C24, pp. 897908, Sept. 1975.
[3] F. S. Baskett and A. J. Smith, "Interference in multiprocessor computer systems with interleaved memory,"Commun. ACM, vol. 19, pp. 327334, Jun. 1976.
[4] C. H. Hoogendoorn, "A general model for memory interference in multiprocessors,"IEEE Trans. Comput., vol. C26, pp. 9981005, Oct. 1977.
[5] D. W. Yen, J. H. Patel, and E. S. Davidson, "Memory interference in synchronous multiprocessor systems,"IEEE Trans. Comput., vol. C31, pp. 11161121, Nov. 1982.
[6] R. J. Swanet al., "CM*A modular multimicroprocessor," inProc. AFIPS, 1977, pp. 637644.
[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 multiplemicroprocessor system,"IEEE Trans. Comput., vol. C28, pp. 2837, Jan. 1979.
[9] A. Goyal and T. Agerwala, "Performance analysis of future shared storage systems,"IBM J. Res. Develop., vol. 28, pp. 95108, Jan. 1984.
[10] M. Ajmone Marsan, G. Balbo, and G. Conte, "Comparative performance analysis of singlebus multiprocessor architectures,"IEEE Trans. Comput., vol. C31, pp. 11791191, Dec. 1982.
[11] K. B. Irani and I. H.Önyüksel, "A closedform solution for the performance analysis of multiplebus multiprocessor systems,"IEEE Trans. Comput., vol. C33, pp. 10041012, Nov. 1984.
[12] W. J. Gordon and G. F. Newell, "Closed queueing systems with exponential servers,"Oper. Res., vol. 15, pp. 254265, 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. 248260, 1975.
[14] P. J. Denning and J. P. Buzen, "The operational analysis of queueing network models,"ACM Comput. Surveys, vol. 10, pp. 225261, 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. 295300, May 1975.
[19] M. Ajmone Marsen and M. Gerla, "Markov models for multiplebus multiprocessor systems,"IEEE Trans. Comput., vol. C31, pp. 239248, Mar. 1982.