Dining philosophers problem
Videos
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.
In the problem, each philosopher has a bowl of spaghetti and can reach the two forks on either side of them.
Sir Tony Hoare IMG 5125