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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:b6aeab362952 · see in the full table