(en.wikipedia.org) Dining philosophers problem - Wikipedia

ROAM_REFS: https://en.wikipedia.org/wiki/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. Soon after, Tony Hoare gave the problem its present form.

Local Graph

org-roam 582f1c7a-b7ec-40cb-95f9-55c3353bf07e (en.wikipedia.org) Dining philosopher... //en.wikipedia.org/wiki/Computer_science https://en.wikipedia.org/wiki/Computer_science 582f1c7a-b7ec-40cb-95f9-55c3353bf07e->//en.wikipedia.org/wiki/Computer_science //en.wikipedia.org/wiki/Concurrency_(computer_science) https://en.wikipedia.org/wiki/Concurrency_(computer_science) 582f1c7a-b7ec-40cb-95f9-55c3353bf07e->//en.wikipedia.org/wiki/Concurrency_(computer_science) //en.wikipedia.org/wiki/Synchronization_(computer_science) https://en.wikipedia.org/wiki/Synchronization_(computer_science) 582f1c7a-b7ec-40cb-95f9-55c3353bf07e->//en.wikipedia.org/wiki/Synchronization_(computer_science) //en.wikipedia.org/wiki/Edsger_W._Dijkstra https://en.wikipedia.org/wiki/Edsger_W._Dijkstra 582f1c7a-b7ec-40cb-95f9-55c3353bf07e->//en.wikipedia.org/wiki/Edsger_W._Dijkstra //en.wikipedia.org/wiki/Resource_contention https://en.wikipedia.org/wiki/Resource_contention 582f1c7a-b7ec-40cb-95f9-55c3353bf07e->//en.wikipedia.org/wiki/Resource_contention //en.wikipedia.org/wiki/Tape_drive https://en.wikipedia.org/wiki/Tape_drive 582f1c7a-b7ec-40cb-95f9-55c3353bf07e->//en.wikipedia.org/wiki/Tape_drive //en.wikipedia.org/wiki/Tony_Hoare https://en.wikipedia.org/wiki/Tony_Hoare 582f1c7a-b7ec-40cb-95f9-55c3353bf07e->//en.wikipedia.org/wiki/Tony_Hoare