Often referred to as the Dining Philosophers Problem, is a classical synchronization problem that explores the challenges of resource sharing and deadlock avoidance.
c
makefile
thread
deadlock
multithreading
gdb
semaphore
pthreads
valgrind
norminette
mutex-synchronisation
dining-philosophers-problem
philosophers
data-races
mutexes-locks
-
Updated
Jun 26, 2024 - C