By Topic

Distributed round-robin and first-come first-serve protocols and their application to multiprocessor bus arbitrary

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Vernon, M.K. ; Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA ; Manber, U.

The round-robin (RR) protocol, which uses statically assigned arbitration numbers to resolve conflict during an arbitration, is more robust and simpler to implement than previous distributed RR protocols that are based on rotating-aging priorities. The proposed first-come-first-served (FCFS) protocol uses partly static arbitration numbers, and is the first practical proposal for a FCFS arbiter known the authors. The proposed protocols have a better combination of efficiency, cost, and fairness characteristics than existing multiprocessor bus arbitration algorithms. Three implementations of the RR protocol, and two implementations of the FCFS protocol, are discussed. Simulation results are presented that address: (1) the practical potential for unfairness in the simpler implementation of the FCFS protocol: (2) the practical implications of the higher waiting-time variance in the RR protocol; and (3) the allocation of bus bandwidth among agents with unequal request rate in each protocol. The simulation results indicate that there is very little practical difference in the performance of the two protocols

Published in:

Computer Architecture, 1988. Conference Proceedings. 15th Annual International Symposium on

Date of Conference:

30 May-2 Jun 1988