Effective Memory Bandwidth and Processor Blocking Probability in Multiple-Bus Systems
IEEE Transactions on Computers
Random number generators: good ones are hard to find
Communications of the ACM
Design and Analysis of Arbitration Protocols
IEEE Transactions on Computers
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
Modular Asynchronous Arbiter Insensitive to Metastability
IEEE Transactions on Computers
Analysis of channel utilization for controller area networks
Computer Communications
| Hi-index | 14.98 |
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.