Cooperating Sequential Processes¶
Dijkstra, E. W. (1965). Cooperating Sequential Processes.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Safe-State Admission Check
- The bank runs a safe-state check instead, following the shape of Dijkstra's Banker's Algorithm.
This sourcePresents the Banker’s Algorithm as admitting resource requests only when the resulting allocation remains safe.
- The bank runs a safe-state check instead, following the shape of Dijkstra's Banker's Algorithm.
- Work Slot Token
- It is the concurrency primitive of computing made physical — a counting semaphore is exactly a pool of tokens that a process must acquire before entering
This sourceDefines semaphore control in which a process performs the acquisition operation before entering a protected section and the release operation after leaving it.
- It is the concurrency primitive of computing made physical — a counting semaphore is exactly a pool of tokens that a process must acquire before entering
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
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.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:1d90b90bb8e4 · see in the full table