Construct · 1 fields · 1 citations

dining philosophers problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Operating systems

a synchronization problem in which processes in a cycle compete for shared resources, used to study deadlock and starvation avoidance.

In operating systems, dining philosophers problem refers to a synchronization problem in which processes in a cycle compete for shared resources, used to study deadlock and starvation avoidance. This meaning comes from Dijkstra (1971) in Acta Informatica.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how dining philosophers problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

starvation3 fields · 3 citationsjingle · one word, three constructs avoidance2 fields · 3 citationsjingle · one word, two carriers cycle4 fields · 4 citationsjingle · one word, four constructs

References

Dijkstra, E. W. (1971). Hierarchical ordering of sequential processes. Acta Informatica, 1(2), 115-138. https://doi.org/10.1007/bf00289519

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct