PHILOSOPHERS
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.
Overview
One or more philosophers sit at a round table.
There is a large bowl of spaghetti in the middle of the table.
• The philosophers alternatively eat, think, or sleep.
While they are eating, they are not thinking nor sleeping; while thinking, they are not eating nor sleeping;
and, of course, while sleeping, they are not eating nor thinking.
• There are also forks on the table. There are as many forks as philosophers.
• Because serving and eating spaghetti with only one fork is very inconvenient, a philosopher takes their right and their left forks to eat, one in each hand.
• When a philosopher has finished eating, they put their forks back on the table and start sleeping. Once awake, they start thinking again. The simulation stops when a philosopher dies of starvation.
• Every philosopher needs to eat and should never starve.
• Philosophers don’t speak with each other.
• Philosophers don’t know if another philosopher is about to die.
• No need to say that philosophers should avoid dying
Arguments
- number_of_philosophers
- time_to_die time_to_eat
- time_to_sleep
- number_of_times_each_philosopher_must_eat
Compiling commands
make - compile
make re - re compile
make clean - clean *.o files
make fclean - clean all
Example
./philo 5 800 200 200 - no one should die!
./philo 5 800 200 200 7 - no one should die and the simulation should stop when all the philosopher has eaten atleast 7 times each.
./philo 4 410 200 200 - no one should die!
./philo 4 310 200 100 - a philosopher should die!