Description: use threaded program to achieve realization philosophers problem. Installed capacity on behalf of five signal five fork, in early values are one, five fork can take, and set up five representatives of five threads philosopher, the value of 0 to 4, provisions of the odd philosopher he first took up the left fork. then plain his right fork, and even philosophers, on the contrary. accordingly, will be one, on the 2nd philosopher competition on the 1st fork, 3, philosopher competition on the 4th on the 3rd fork. that is five philosophers competition odd, fork, access, even longer competitive, fork, they will eventually have access to a philosopher two fork and eat. But philosophers are not eligible to enter the queue waiting for obstruction, root FIFO principle, I will apply the first philosop
File list (Check if you may need any files):
Download