Part 11 answers: How do the two sides agree at start-up?
Before the first transaction, both sides have to come out of reset in a safe order, notice each other, agree on speed, width and features, and for high-speed links, train their receivers. Many field failures live here.
This part covers reset semantics, reset sequencing across an interface, presence and hot-plug, link training, capability negotiation, enumeration, link state machines and versioning.
Say what happens to transactions caught by a reset.
Draw a generic link state machine.
Design a capability exchange that old devices still understand.
Answer each in your head before opening it. If two or more feel shaky, revisit Part 10: Reliability and Recovery first.
Every burst error of length r or less (for a generator polynomial with an x⁰ term), plus most other errors.
So it can resend packets the receiver rejected or never acknowledged; it frees each copy only when an acknowledgement covers it.
With 2ⁿ outstanding, a full window of new packets and a full window of replays would carry the same sequence numbers, and the receiver could not tell them apart.
# | Lesson | Level | Status |
|---|---|---|---|
11.1 | W · Working | Ready | |
11.2 | S · Senior | Ready | |
11.3 | W · Working | Ready | |
11.4 | S · Senior | Ready | |
11.5 | W · Working | Ready | |
11.6 | W · Working | Ready | |
11.7 | S · Senior | Ready | |
11.8 | 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.