Part 8 answers: Who gets the wire?
As soon as two requesters share a wire, a port or a buffer, something must decide who goes first. That decision sets fairness, latency for the urgent, and whether anyone can starve.
This part covers topologies, arbitration policies, fairness and starvation, priority inversion, arbitration granularity, distributed arbitration, quality of service, virtual channels, routing and broadcast.
Design a round-robin arbiter and prove it cannot starve anyone.
Explain how two I2C masters resolve a collision.
Say what a virtual channel buys.
Answer each in your head before opening it. If two or more feel shaky, revisit Part 7: Ordering first.
If the write that sets a ready flag can overtake the write of the data, a consumer can see the flag and read stale data.
It stops later operations from becoming visible before earlier ones have, forcing order where the protocol would otherwise allow overtaking.
No. Many protocols allow an early response from a buffer on the way; what it promises depends on the protocol and the attributes of the write.
# | Lesson | Level | Status |
|---|---|---|---|
8.1 | W · Working | Ready | |
8.2 | F · Foundation | Ready | |
8.3 | W · Working | Ready | |
8.4 | S · Senior | Ready | |
8.5 | W · Working | Ready | |
8.6 | W · Working | Ready | |
8.7 | S · Senior | Ready | |
8.8 | S · Senior | Ready | |
8.9 | S · Senior | Ready | |
8.10 | P · Principal | Ready | |
— | all levels | Ready | |
— | all levels | Ready |
Every lesson in this part is ready. Work through them in order: each one sets up the problem the next one solves.
This course teaches why protocols are designed the way they are. These lessons show how to build or sign off the same ideas, so this part links to them instead of repeating them.