Brief Description:The Dining Philosophers problem is stated as follows: Five philosophers are seated around a circular table. Each philosopher has a plate of especially slippery spaghetti. The spaghetti is so slippery that a philosopher needs two forks to eat it. Between each plate is a fork. The life of a philosopher consists of alternate periods of eating and thinking. When a philosopher gets hungry, he/she tries to acquire his/her forks, eats for a while, then puts down the forks and contin ues to think.
Audience:A course on Computer Networking and Distributed Computing.
Equipment:Workstations running UNIX.
Hi, I can help you with this problem. I just finished a rigorous Operating Systems course and these concepts are fresh in my mind. I can provide the quickest turnaround. Which language are you supposed to use? Please PM for details.
Regards,
Usama
You haven't posted the language or what you're specifically trying to achieve, but this is a learning example of semaphore and priority scheduling based on racing conditions.
With further instructions I could implement it.
Hello, altough the description is not very clear on what you need I think I might be able to help you.
Relevant Skills and Experience
I programmed the problem in java before. I'm familier with threading and locks.