CentralNotice From Wikipedia, the free encyclopedia Jump to navigation Jump to search 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, presented in terms of computers competing for access to tape drive peripherals. Soon after, Tony Hoare gave the problem its present formulation. [1] [2] [3] 1 Problem statement 1.1 Problems 2 Solutions 2.1 Resource hierarchy solution 2.2 Arbitrator solution 2.3 Chandy/Misra solution 3 See also 4 References 5 Bibliography 6 External links Problem statement [ edit ] Illustration of the dining philosophers problem. Five silent philosophers sit at a round table with bowls of spaghetti . Forks are p...