A worked mechanism
Aggregate bandwidth does not specify a fairness bound.
Compare accepted-byte distributions over one fixed measurement window with all four channels continuously eligible.
Schedule A
Aggregate 12 GB/s
The accepted rate is 12, 0, 0, 0 GB/s across channels 0–3.
Schedule B
Aggregate 12 GB/s
The accepted rate is 3, 3, 3, 3 GB/s across channels 0–3.
Requirement under review
Name the missing bound
The aggregate threshold alone distinguishes neither distribution. Fairness needs a separate measurable rule.
A possible added contract
Owner + measurement
Specify a maximum eligible waiting age or minimum service over a stated window and traffic envelope.
Work it through
Turn concern into a testable requirement
Both distributions meet the arithmetic total. A reviewer must separately decide whether starvation is forbidden and under what eligibility, credit, and downstream-service assumptions.
Do not claim equal shares are required unless the specification actually says so.
Watch for this
An inactive or credit-blocked channel is not necessarily entitled to the same service as a continuously eligible one.
Check your reasoning
Collect accepted bytes per channel and eligible waiting age beside total throughput; attach any fairness limit to its requirement ID.
Check your understanding
Questions to reason through.
What makes a hardware requirement verifiable?
It names an observable subject, a measurable behavior or limit, the operating conditions, and an unambiguous pass condition. “High performance” is an aspiration; “sustain 12 GB/s for legal 256-byte bursts at 500 MHz while honoring downstream backpressure” can be designed, constrained, and tested.
Put it into practice
Explain the decision behind the design.
Practice Specification to Microarchitecture in the question bankContinue the learning path

