A C programming answer to Dijkstra's dining philosophers problem using threads and mutexes.
-
Updated
Oct 27, 2022 - C
A C programming answer to Dijkstra's dining philosophers problem using threads and mutexes.
This project is about learning how threads work by precisely timing a group of philosophers on when to pick up forks and eat spaghetti without dying from hunger.
Add a description, image, and links to the threadsandmutexes topic page so that developers can more easily learn about it.
To associate your repository with the threadsandmutexes topic, visit your repo's landing page and select "manage topics."