Description: Use graphical interface simulation scenario is as follows: a round-table, there is a large bowl, five plates, one for each philosopher, there are five forks. Every philosopher would like to eat will be allocated to the table next to his position, the use of plates on both sides of the fork, take surface and eat noodles. The question is: to design an algorithm to allow philosophers to eat. Algorithm must ensure that mutually exclusive (no two philosophers use the same fork at the same time), but also to avoid deadlock and starvation.
File list (Check if you may need any files):
Download