Introduction - If you have any usage issues, please Google them yourself
Dining philosophers problem, a left-handed, at least the use of semaphores, messaging, tube three ways a simulated dining philosophers problem.
With an input variable to control whether a left-handed philosopher. If there is, its numbers by random number generation.
Simulation program is divided into two situations,
A deadlock can occur in the case of death, when the lock output of resource allocation state and historical resource allocation state
Design without a deadlock occurs when the program, each philosopher completion of at least one meal, output the resources allocated to the philosopher s current and historical status.
Best to have a graphical interface, dynamic display of the dining philosophers process.