• Publication
  • 1988
  • Issue No. 5 - May
  • Abstract - Product-Form Solution Techniques for the Performance Analysis of Multiple-Bus Multiprocessor Systems with Nonuniform Memory References
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Product-Form Solution Techniques for the Performance Analysis of Multiple-Bus Multiprocessor Systems with Nonuniform Memory References
May 1988 (vol. 37 no. 5)
pp. 532-540
ASCII Text
x 
 
G. Chiola, M.A. Marsan, G Balbo, "Product-Form Solution Techniques for the Performance Analysis of Multiple-Bus Multiprocessor Systems with Nonuniform Memory References," IEEE Transactions on Computers, vol. 37, no. 5, pp. 532-540, May, 1988.
 
 
BibTex
x
 
@article{ 10.1109/12.4604,
author = {G. Chiola and M.A. Marsan and G Balbo},
title = {Product-Form Solution Techniques for the Performance Analysis of Multiple-Bus Multiprocessor Systems with Nonuniform Memory References},
journal ={IEEE Transactions on Computers},
volume = {37},
number = {5},
issn = {0018-9340},
year = {1988},
pages = {532-540},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.4604},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Product-Form Solution Techniques for the Performance Analysis of Multiple-Bus Multiprocessor Systems with Nonuniform Memory References
IS - 5
SN - 0018-9340
SP532
EP540
EPD - 532-540
A1 - G. Chiola,
A1 - M.A. Marsan,
A1 - G Balbo,
PY - 1988
KW - local balance property; performance analysis; multiple-bus multiprocessor systems; nonuniform memory references; exact computation; steady-state probability distribution; queuing models with passive resources; product-form solution; recursive solution; processor access rates; memory selection probabilities; first-come-first-served bus scheduling policy; multiprocessor interconnection networks; numerical analysis; performance evaluation; queueing theory; scheduling.
VL - 37
JA - IEEE Transactions on Computers
ER -
 
Recursive relations are derived for the exact computation of the steady-state probability distribution of some queuing models with passive resources that can be used to analyze the performance of multiple-bus multiprocessor system architectures. The most general case that can be shown to admit a product-form solution is described, and a recursive solution is obtained taking into account, consid

[1] D. P. Bhandarkar, "Analysis of memory interference in multiprocessors,"IEEE Trans. Comput., vol. C-24, pp. 897-908, Sept. 1975.
[2] F. S. Baskett and A. J. Smith, "Interference in multiprocessor computer systems with interleaved memory,"Commun. ACM, vol. 19, pp. 327-334, Jun. 1976.
[3] C. H. Hoogendoorn, "A general model for memory interference in multiprocessors,"IEEE Trans. Comput., vol. C-26, pp. 998-1005, Oct. 1977.
[4] A. S. Sethi and N. Deo, "Interference in multiprocessors systems with localized memory access probabilities,"IEEE Trans. Comput., vol. C-28, pp. 157-163, Feb. 1979.
[5] 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.
[6] P. A. Jacobson and E. D. Lazowska, "Analyzing queueing networks with simultaneous resource possession,"Commun. ACM, vol. 25, pp. 142-151, Feb. 1982.
[7] M. Ajmone Marsan and M. Gerla, "Markov models for multiple bus multiprocessor systems,"IEEE Trans. Comput., vol. C-31, pp. 239- 248, Mar. 1982.
[8] M. Ajmone Marsan, "Bounds on bus and memory interference in a class of multiple bus multiprocessor systems," inProc. 3rd Int. Conf. Distributed Comput. Syst., Fort Lauderdale, FL, Oct. 1982, pp. 792-798.
[9] F. Fung and H. Torng, "On the analysis of memory conflicts and bus contentions in a multiple-microprocessor system,"IEEE Trans. Comput., vol. C-28, Jan. 1979.
[10] M. Valero, E. Sanvicente, J. M. Llaberia, T. Lang, and J. Labarta, "A performance evaluation of the multiple bus network for multiprocessor systems," inProc. SIGMETRICS Conf., ACM, Minneapolis, MN, Aug. 1983, pp. 200-206.
[11] D. Towsley, "An approximate analysis of multiprocessor systems," inProc. SIGMETRICS Conf., ACM, Minneapolis, MN, Aug. 1983, pp. 207-213.
[12] T. Lang, M. Valero, and I. Alegre, "Bandwidth of crossbar and multiple bus connection for multiprocessors,"IEEE Trans. Comput., vol. C-31, pp. 1227-1234, Dec. 1982.
[13] D. Towsley, "Approximate models of multiple bus multiprocessor systems,"IEEE Trans. Comput., vol. C-35, pp. 220-228, Mar. 1986.
[14] 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.
[15] K. B. Irani and I. H. Onyuksel, "A closed form solution for the performance analysis of multiple bus multiprocessor systems,"IEEE Trans. Comput., vol. C-33, pp. 1004-1012, Nov. 1984.
[16] M. Ajmone Marsan, G. Balbo, G. Chiola, and S. Donatelli, "On the product form solution of a class of multiple bus multiprocessor system models," inProc. Int. Workshop Modeling Perform. Eval. Parallel Syst., Grenoble, France, Dec. 1984. Also inJ. Syst. Software, vol. 6, pp. 117-124, May 1986.
[17] J. Y. Le Boudec, "A BCMP extension to multiserver stations with concurrent classes of customers," inProc. PERFORMANCE'86 and ACM SIGMETRICS, Raleigh, NC, May 1986.
[18] D. Towsley, "Local balance models of computer systems," Ph.D. dissertation, Univ. Texas at Austin, Austin, TX, 1975.
[19] T. W. Keller, "Computer system models with passive resources," Ph.D. dissertation, Univ. Texas at Austin, Austin, TX, 1976.
[20] K. M. Chandy and C. H. Sauer, "Approximate methods for analysis of queueing network models of computer system,"Comput. Surveys, vol. 10, pp. 263-280, 1978.
[21] M. Ajmone Marsan, G. Balbo, and G. Conte, "A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems,"ACM Trans. Comput. Syst., vol. 2, pp. 93-122, May 1984.
[22] G. Chiola, "Comments on 'A closed form solution for the performance analysis of multiple bus multiprocessor systems,'" submitted for publication.
[23] K. M. Chandy, U. Herzog, and L. Woo, "Parametric analysis of queueing network models,"IBM J. Res. Develop., vol. 19, pp. 36- 42, Jan. 1975.
[24] P. J. Denning and J. P. Buzen, "The operational analysis of queueing network models,"ACM Comput. Surveys, vol. 10, pp. 225-261, Sept. 1978.
[25] K. M. Chandy and A. J. Martin, "A characterization of product form queueing networks,"J. ACM, vol. 30, pp. 286-299, 1983.
[26] G. Chiola, M. Ajmone Marsan, and G. Balbo, "Product form solution techniques for the performance analysis of multiple bus multiprocessor systems with non uniform memory references," Internal Rep., Dipartimento di Informatica, Universitàdi Torino, Torino, Italy, 1985.
[27] J. Y. Le Boudec, "The multibus algorithm," INRIA Res. Rep. 539, Rennes Cedex, France, June 1986,Perform. Eval., to be published.

Index Terms:
local balance property; performance analysis; multiple-bus multiprocessor systems; nonuniform memory references; exact computation; steady-state probability distribution; queuing models with passive resources; product-form solution; recursive solution; processor access rates; memory selection probabilities; first-come-first-served bus scheduling policy; multiprocessor interconnection networks; numerical analysis; performance evaluation; queueing theory; scheduling.
Citation:
G. Chiola, M.A. Marsan, G Balbo, "Product-Form Solution Techniques for the Performance Analysis of Multiple-Bus Multiprocessor Systems with Nonuniform Memory References," IEEE Transactions on Computers, vol. 37, no. 5, pp. 532-540, May 1988, doi:10.1109/12.4604
Usage of this product signifies your acceptance of the Terms of Use.