Definition: Suppose a number of philosophers surround a dining table. Adjacent philosophers share one fork. They spend time thinking or trying to eat. A philosopher must have both the fork on the left and the fork on the right to eat. Clearly adjacent philosophers cannot eat at the same time. The problem is to find an algorithm for taking forks that prevents deadlock, starvation, etc.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 8 November 2021.
HTML page formatted Mon Nov 22 06:32:06 2021.
Cite this as:
Paul E. Black, "dining philosophers", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 8 November 2021. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/diningphilos.html