PROBABILISTIC ANALYSIS OF MULTICHANNEL BUS ARBITRATORS OF COMPUTER NETWORK INTERFACES

Abstract

Probabilistic analysis was conducted on the functioning algorithms of bus arbiters within the ‘Common Bus’ interface of computer networks. The research employed the theory of random impulse flows as its apparatus. Analytical dependencies were derived to calculate the average waiting time for service requests from network subscribers. The first-come-first-serve and round-robin service algorithms provided better service uniformity than priority algorithms. Keywords: algorithm, service, request–impulse, interface, bus arbiter, common bus.