This Article 
 Bibliographic References 
 Add to: 
Comments on 'Design and Analysis of Arbitration Protocols' by F. El Guibaly
March 1992 (vol. 41 no. 3)
pp. 348-351

In the above-titled paper by F. El Guibaly, the access time for various arbitration protocols was theoretically characterized. The commenter uses simulations to investigate single-bus multiprocessor arbitration protocols. Differences are found between the theoretical results and the simulation results. Theoretical formulae given by El Guibaly are corrected and modified to take into account that resubmitted requests increase the request rate. Closer agreement between theoretical and simulation results is then obtained.

[1] F. El Guibaly, "Design and analysis of arbitration protocols,"IEEE Trans. Comput., vol. 38, pp. 161-171, Feb. 1989.
[2] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
[3] S. K. Park and K. W. Miller, "Random number generators: Good ones are hard to find,"Commun. ACM, vol. 31, pp. 1192-1201, Oct. 1988.
[4] D. W. L. Yen, J. H. Patel, and E. S. Davidson, "Memory interference in synchronous multiprocessor systems,"IEEE Trans. Comput., vol. C-31, pp. 1116-1121, Nov. 1982.
[5] T. N. Mudge, J. P. Hayes, G. D. Buzzard, and D. C. Winsor, "Analysis of multiple bus interconnection networks,"Proc. 1984 Int. Conf. Parallel Processing, IEEE, 1984, pp. 228-232.
[6] Y-C Liu and C-J Jou, "Effective memory bandwidth and processor blocking probability in multiple-bus systems,"IEEE Trans. Comput., vol. C-36, pp. 761-764, June 1987.

Index Terms:
arbitration protocols; access time; single-bus multiprocessor; simulation; multiprocessor interconnection networks; protocols.
B. Wilkinson, "Comments on 'Design and Analysis of Arbitration Protocols' by F. El Guibaly," IEEE Transactions on Computers, vol. 41, no. 3, pp. 348-351, March 1992, doi:10.1109/12.127447
Usage of this product signifies your acceptance of the Terms of Use.