Product-Form Solution Techniques for the Performance Analysis of Multiple-Bus Multiprocessor Systems with Nonuniform Memory References
Issue No. 05 - May (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.4604
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
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.
G. Balbo, G. Chiola and M. Marsan, "Product-Form Solution Techniques for the Performance Analysis of Multiple-Bus Multiprocessor Systems with Nonuniform Memory References," in IEEE Transactions on Computers, vol. 37, no. , pp. 532-540, 1988.