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:

    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)

    No matter what Aristotle and the Philosophers say, nothing is equal to tobacco; it’s the passion of the well-bred, and he who lives without tobacco lives a life not worth living.
    Molière [Jean Baptiste Poquelin] (1622–1673)

    Congress seems drugged and inert most of the time. ...Its idea of meeting a problem is to hold hearings or, in extreme cases, to appoint a commission.
    Shirley Chisholm (b. 1924)