DRAM Detective · Case File 1.13

Nearest First, Farthest Last

Ranks on a fly-by bus arrive at different times — rank-to-rank measures the gap so switching stays aligned.
The shout reaches everyone, CS names one…
CS = the name call · fly-by = first come, later arrive · shared wire = one talker at a time
CS picks the rank — the shout reaches all, CS names one CA / CK — broadcast to everyone R0 R1 R2 R3 CS_n pulled low → only this one listens DQ / DQS — one shared wire CA is the shout · CS is the name call · the wire is shared nearest first, farthest last — flight time CTRL R0 R1 R2 R3 t0 · first t1 t2 t3 · last near → first, far → last Δ = t3 − t0 — the gap rank-to-rank must cover only first and last need measuring — the rest fall in between one talks at a time, with a gap between rank A's burst gap rank B's burst one rank drives, the others go high-impedance the gap = turnaround — switch too fast and they collide
Step 1 of 3
Nearest rank hears first, farthest hears last. Measure the gap, and switching stays on time — without collision.