It is a distributed version of the Dining Philosophers problem. Attached is a file with specific directions. Notice that you will have a server that creates 10 child processes using fork(). The ten children processes will represent 5 philosophers and 5 forks. TCP/IP connections between each philosopher and the two adjacent forks will determine when the philosopher can obtain a fork. The program will have to provide for a means for releasing resources if deadlock results.
The programming should be done in C.
2 freelancere byder i gennemsnit $175 på dette job
Hi I am very interesting your project. Already I made many mobile Apps using native Ios and Andorid. Once you contact me, You can see my old project urls. My target is 100% success job. Regards.