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)

    These philosophers dwell on the inevitability and unchangeableness of laws, on the power of temperament and constitution, the three goon, or qualities, and the circumstances, or birth and affinity. The end is an immense consolation; eternal absorption in Brahma.
    Henry David Thoreau (1817–1862)

    The problem ... is emblematic of what hasn’t changed during the equal opportunity revolution of the last 20 years. Doors opened; opportunities evolved. Law, institutions, corporations moved forward. But many minds did not.
    Anna Quindlen (b. 1952)