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, in terms of computers competing for access to tape drive peripherals. Soon after, Tony Hoare gave the problem its present formulation.
Read more about Dining Philosophers Problem: Problem Statement, Example Solution
Famous quotes containing the words dining, philosophers and/or problem:
“I had rather be shut up in a very modest cottage, with my books, my family and a few old friends, dining on simple bacon, and letting the world roll on as it liked, than to occupy the most splendid post which any human power can give.”
—Thomas Jefferson (1743–1826)
“You ask: What is it that philosophers have called qualitative states? I answer, only half in jest: As Louis Armstrong is said to have said when asked what jazz is, ‘If you got to ask, you ain’t never gonna get to know.’”
—Ned Block (b. 1942)
“One thing in any case is certain: man is neither the oldest nor the most constant problem that has been posed for human knowledge.”
—Michel Foucault (1926–1984)