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:
“Roast Beef, Medium, is not only a food. It is a philosophy. Seated at Life’s Dining Table, with the menu of Morals before you, your eye wanders a bit over the entrées, the hors d’oeuvres, and the things à la though you know that Roast Beef, Medium, is safe and sane, and sure.”
—Edna Ferber (1887–1968)
“When philosophers try to be politicians they generally cease to be philosophers.”
—Walter Lippmann (1889–1974)
“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)