This project is an implementation of the classic dining philosophers problem using threads and mutexes. The problem is a classic multi-process synchronization problem which was originally formulated in 1965 by Edsger Dijkstra.
- The program creates a specified number of philosopher threads.
- Each philosopher alternates between thinking and eating.
- To simulate both actions, the program uses sleep functions.
- Philosophers communicate with each other using mutexes.
- GCC compiler
- Make
./philo [arguments]