hesela.devBuffer-cycle deadlock
Buffer-cycle deadlock occurs when frames hold buffers while each waits for another buffer in a closed dependency chain.
The 1996 Fibre Channel study models dependencies induced by permitted routes between switch input buffers. A cycle-free dependency graph provides deadlock-free routing within that model. This is a statement about resource dependencies, not simply the presence of a loop in the cabling. [1]
A zero-credit counter alone does not identify such a cycle. Investigate the forwarding paths and occupied resources before attributing a stall to deadlock.
Relations
Citations
Sources & caveats
- Historical architectural model; no claim about current vendor routing implementations or measured deadlock incidence.