|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Oct. 1985 (vol. 34 no. 10)
pp. 934-942
| ASCII Text | x | ||
| Trevor N. Mudge, Humoud B. Al-Sadoun, "A semi-Markov model for the performance of multiple-bus systems," IEEE Transactions on Computers, vol. 34, no. 10, pp. 934-942, Oct., 1985. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1985.6312197, author = {Trevor N. Mudge and Humoud B. Al-Sadoun}, title = {A semi-Markov model for the performance of multiple-bus systems}, journal ={IEEE Transactions on Computers}, volume = {34}, number = {10}, issn = {0018-9340}, year = {1985}, pages = {934-942}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1985.6312197}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A semi-Markov model for the performance of multiple-bus systems IS - 10 SN - 0018-9340 SP934 EP942 EPD - 934-942 A1 - Trevor N. Mudge, A1 - Humoud B. Al-Sadoun, PY - 1985 KW - semi-Markov processes KW - Markov chains KW - memory bandwidth KW - memory interference KW - multiple-bus system KW - multiprocessors KW - performance evaluation VL - 34 JA - IEEE Transactions on Computers ER - | |||
This paper presents a discrete time model of memory interference in multiprocessor systems employing multiple-bus interconnection networks. It differs from earlier models in its ability to model variable connection time and arbitrary inter-request time. The model describes each processing element's behavior by means of a semi-Markov process. It takes as input the number of processing elements, the number of memory modules, the number of buses, the mean think time of the processing elements, and the first and second moments of the connection time between processing elements and memories. The model produces as output the memory bandwidth, processing element utilization, memory module utilization, average queue length at a memory, and average waiting time experienced by a processing element while waiting to access a memory. Using the model, it is possible to analyze the interaction of the input parameters on the system performance. This modeling capability is attained without having to employ a complex Markov chain. In fact, a four-state semi-Markov process is sufficient regardless of the think and connection time distributions. The accuracy and capability of the model is illustrated.
Index Terms:
semi-Markov processes,Markov chains,memory bandwidth,memory interference,multiple-bus system,multiprocessors,performance evaluation
Citation:
Trevor N. Mudge, Humoud B. Al-Sadoun, "A semi-Markov model for the performance of multiple-bus systems," IEEE Transactions on Computers, vol. 34, no. 10, pp. 934-942, Oct. 1985, doi:10.1109/TC.1985.6312197
Usage of this product signifies your acceptance of the Terms of Use.

