Dining Philosophers Problem

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)

    Vanity is so anchored in the heart of man that a soldier, a soldier’s servant, a cook, a porter brags and wishes to have his admirers. Even philosophers wish for them. Those who write against vanity want to have the glory of having written well; and those who read it desire the glory of having read it. I who write this have perhaps this desire, and perhaps those who will read it.
    Blaise Pascal (1623–1662)

    What happened at Hiroshima was not only that a scientific breakthrough ... had occurred and that a great part of the population of a city had been burned to death, but that the problem of the relation of the triumphs of modern science to the human purposes of man had been explicitly defined.
    Archibald MacLeish (1892–1982)