[Glean] Round-Robin Arbitration

Published: June 25, 2020 by SingularityKChen (Last updated: June 29, 2020 )

• Categories:
• Glean 53

• Tags:
• RoundRobin 1

• Round-Robin Arbitration

Round-Robin Arbitration

Round robin arbitration is a scheduling scheme which gives to each requestor its share of using a common resource for a limited time or data elements.¹

The simplest form of round robin arbiter is based on assignment of a fixed time slot per requestor; this can be implemented using a circular counter.

Alternatively, the weighted round robin arbiter (WRR) is defined to allow a specific number X of data elements per each requestor, in which case X data elements from each requestor would be processed before moving to the next one.

Round robin arbiters are typically used for arbitration for shared resources, load balancing, queuing systems, and resource allocation.

1. RTLery, http://rtlery.com/articles/round-robin-arbitration ↩