RGD stands for Request (r_i), Grant (g_i), and Done (d).
When An RGd1 Arbiter receives two requests, it will grant exactly one of them (and delay the other). The specification leaves the choice open. Often there is a fairness requirement on this choice: if a choice situation arises `infinitely often' then both outputs are chosen `infinitely often'.
The RGd1 Arbiter only has a single done input, in contrast to the more common variant, the RGD Arbiter that has two done inputs, one for each requesting party.
No information available
Specification in DI Algebra:
NAME = "RGD 1-arbiter"
I = { r0?, r1?, d? }
O = { g0!, g1! }
RGD = [ r0? -> g0! ; d?; RGD,
r1? -> g1! ; d?; RGD,
d? -> CHAOS
]
Also available through this link
The subscripts 0 and 1 can be interchanged systematically.
An RGd1 Arbiter is not output deterministic. The output nondeterminism is dynamic.
No information available
No information available
No information available
No information available