Dining philosophers problem
Problem used to illustrate synchronization issues and techniques for resolving them
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive peripherals and then formulated in terms of diners, dubbed the "dining quintet".
Nº Q865867 ★★★
Rare · History
Dining philosophers problem
Problem used to illustrate synchronization issues and techniques for resolving them
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive peripherals and then formulated in terms of diners, dubbed the "dining quintet".
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive peripherals and then formulated in terms of diners, dubbed the "dining quintet". Soon after, Tony Hoare gave the problem its present name.
Text: Wikipédia, CC BY-SA 4.0. · Image: Benjamin D. Esham (bdesham) (CC BY-SA 3.0) ·
Related cards
Entscheidungsproblem
In computer science, the impossible task of algorithmically determining whether a given statement is provable from the axioms
Nº Q11030584 ★★
Edsger W. Dijkstra
Dutch computer scientist (1930–2002)
Nº Q8556 ★★★
Archimedes's cattle problem
A problem in number theory with a very large solution, attributed to Archimedes
Nº Q2030594 ★★
Stoned ape theory
Theory on the history of human cognitive development
Nº Q115857865 ★★★
My Dinner with Adolf
Satirical short story by Larry David
Nº Q134455096 ★★
Hilbert's sixth problem
Whether the mathematical axiomatic method may be extended to physics
Nº Q10370880 ★★