= Dining philosophers problem
{wiki=Dining_philosophers_problem}
The Dining Philosophers Problem is a classic synchronization problem in computer science and an example of a problem of concurrency. It illustrates the challenges of resource sharing and avoiding deadlock in a multi-threaded environment. \#\#\# Problem Description: The setup involves five philosophers who spend their lives alternately thinking and eating. They sit around a circular dining table with a fork placed between each pair of philosophers. In order to eat, a philosopher must have both forks (one from either side).
Back to article page