| Article ID: | iaor1988401 |
| Country: | Japan |
| Volume: | J71-B |
| Issue: | 8 |
| Start Page Number: | 907 |
| End Page Number: | 914 |
| Publication Date: | Aug 1988 |
| Journal: | Transactions of the Institute of Electronics, Information and Communication Engineers |
| Authors: | Nogami Shinya, Sumita Shuichi |
| Keywords: | queues: theory |
This paper proposes an approximate analysis method for memory contention in a multiprocessor system consisting of two groups of processors having different common memory access rates. The method is modelled on a closed queueing network in which the processors are expressed as jobs. Because it has no product form solution, the model is replaced with an approximate one in which a group of jobs is aggregated to one job, and the characteristic values are calculated iteratively. Finally, the method is demonstrated in a numerical example and its accuracy confirmed by a comparison with simulation results. [In Japanese.]