Dining Philosophers
An implementation similar to the Tannenbaum solution for the Dining Philosophers thread synchronization problem in C.
Utilizes a monitor system with semaphores, simulating a "waiter" to avoid deadlock and starvation.
Credit to Dr. Kui Wu of the University of Victoria for code skeleton.
TODO
- Algorithm in C
- WASM (C to web)
- GitHub Pages
- Parameterization
- Animation?