Dining philosophers problem
Problem used to illustrate synchronization issues and techniques for resolving them
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, presented in terms of computers competing for access to tape drive peripherals and then formulated in terms of diners, dubbed the "dining quintet". Soon after, Tony Hoare gave the problem its present name.
Read on Wikipedia · Image bdesham, User:Belbury, CC BY 3.0
Open boosters, collect cards and trade them. Free to play.
Play for free