Hierarchical Ordering of Sequential Processes¶
Dijkstra, E. W. (1971). Hierarchical Ordering of Sequential Processes. Acta Informatica, 1(2), 115-138.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Deadlock
- Solutions (asymmetric chopstick ordering, think vs. eat states, arbitrated chopstick allocation) demonstrate prevention strategies that remove at least one condition
This sourceIntroduces the dining philosophers problem and formalizes the deadlock conditions and prevention strategies (resource ordering, arbitration).
- Solutions (asymmetric chopstick ordering, think vs. eat states, arbitrated chopstick allocation) demonstrate prevention strategies that remove at least one condition
- Mutual Exclusion
- Five philosophers sit around a table with one fork between each pair; a philosopher needs both adjacent forks to eat.
This sourceIntroduces the dining-philosophers problem, the deadlock arising when all philosophers grab one fork and wait, and resource-ordering as the structural remedy.
- Five philosophers sit around a table with one fork between each pair; a philosopher needs both adjacent forks to eat.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Recorded for 1 of 2 citations of this work.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:b6aeab362952 · see in the full table