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)

    She’s in the house.
    She’s at turn after turn.
    She’s behind me.
    She’s in front of me.
    She’s in my bed.
    She’s on path after path,
    and I’m weak from want of her.
    O heart,
    there is no reality for me
    other than she she
    she she she she
    in the whole of the reeling world.
    And philosophers talk about Oneness.
    Amaru (c. seventh century A.D.)

    The government is huge, stupid, greedy and makes nosy, officious and dangerous intrusions into the smallest corners of life—this much we can stand. But the real problem is that government is boring. We could cure or mitigate the other ills Washington visits on us if we could only bring ourselves to pay attention to Washington itself. But we cannot.
    —P.J. (Patrick Jake)