UVM Tutorial - Round Robin Arbiter

A Round Robin Arbiter is a type of arbitration logic commonly used in digital systems to arbitrate access to a shared resource among multiple requesters. In the context of hardware design, such as in a bus-based or network-on-chip (NoC) system, an arbiter is responsible for deciding which requester gets access to the shared resource at any given time.
The Round Robin Arbiter follows a simple and fair arbitration scheme. Here's a basic overview of how it works:
Requester Priority:
Each requester has a priority assigned to it. The priority could be based on factors like urgency, ID, or a predetermined order.
Round Robin Order:
The Round Robin Arbiter cycles through the requesters in a circular order. In each arbitration cycle, it grants access to the next requester in the sequence.
Request Handling:
When a requester asserts its request signal, the Round Robin Arbiter checks if it is the next in line based on the Round Robin order.
Granting Access:
If the requester is next in line and no higher-priority requesters are active, the arbiter grants access to the requesting module.
Cycle Advancement:
After granting access, the Round Robin Arbiter advances to the next requester in the sequence for the next arbitration cycle.
Fairness:
The Round Robin mechanism ensures fairness because each requester gets a turn to access the shared resource in a sequential manner.
Reset or Priority Override:
The Round Robin Arbiter may have mechanisms to reset the order or override the order based on certain conditions or external signals.

[@LulusCastle]

mam can you share the code or eda link