Bus Arbitration - Daisy Chaining & Reliability Comparison

Daisy Chaining Mechanism

Daisy chaining is centralized serial arbitration. A common Bus Grant (BG) line is daisy-chained through all masters in order of priority.

• Arbiter receives Bus Request (BR) (wired-OR) from any device.
• Arbiter asserts BG - passes through devices sequentially.
• First requesting device in chain closest to arbiter blocks propagation and takes bus, others starved.
• Signals: BR (common) -> Arbiter -> BG1 -> Device1 -> BG2 -> Device2 -> ...
• Simple, fixed priority by physical position, no address needed.

Timing: Request -> Arbiter senses BR -> asserts BG -> ripples via gates (priority logic) -> device asserts Bus Busy (BB) and starts transfer.

---

Comparison w.r.t. Communication Reliability on Hardware Failure

Feature	Daisy Chaining	Polling	Independent Requesting
Wiring	Single BG daisy chain + wired-OR BR + BB	Common BR, Binary count lines + BB from arbiter	Separate BRi/BGi per device + BB
Priority	Fixed by position	Programmable by polling order (arbiter can change)	Programmable via priority encoder, can be fixed/rotating
Failure: BG/BR line open	Single point failure: Break in chain disconnects all downstream devices - entire subsystem beyond fault loses bus. Failure of one device's grant forwarding logic disables lower priority devices.	BG not daisy-chained. Polling counter broadcast to all devices. Open in one device's select logic isolates only that device; others continue. More reliable than daisy.	Most reliable: Each device has dedicated pair. Failure of one device's BR/BG affects only that device. Others unaffected. Full isolation.
Failure: Device power off	If device does not forward BG when idle (must bypass), chain broken unless bypass hardware added.	Unaffected - poll address still generated, non-responding device just skipped.	Unaffected - other lines independent.
Failure: BB stuck	Bus appears busy forever - system hangs for all.	Same - common BB.	Same - common BB is still single point (all methods share this).
Hardware cost	Cheapest - few wires	Moderate - need $\log_2 N$ poll lines + decoder	Highest - $2N$ lines
Response time	Propagation delay $O(N)$ gate delays down chain, slowest.	Polling time $O(N)$ cycles to scan max.	Fastest - arbiter decides in 1 arbitration cycle.

Reliability ranking: Independent Requesting > Polling > Daisy Chain

Daisy chain least reliable because serial grant creates single path failure domain; any device/connector failure cascades downstream. Independent requesting is most fault-isolated, preferred for fault-tolerant multiprocessors though at cost of lines and arbiter complexity. Polling is intermediate - software/hardware reconfigurable polling order can also bypass faulty device dynamically.