Dining Philosopher Problem

[Velan]

In Dining Philosopher problem, I have doubts in Semaphore. Which one of the following is better and suited for what?

1) Applying Semaphores for Other processes (i.e for Philosophers)
2) Applying Semaphore for Other Resources (i.e for Forks).

[Legend]

Well, do you want to use a semaphore that a philosopher has first to get before he can pick up a fork?

Or a semaphore per philosopher?

[Velan]

I have implemented both the methods.

1) Putting semaphore for all the forks.
2) Putting semaphore for every philosophers.

But only one mothod is possible at a time. I would like to which method to choose for efficiency and differentiate.

[Legend]

One semaphore for all forks ... as a result only one philosopher can eat at a time?

[Velan]

It's not like that. If a philosopher wants to eat, he will put a semphore for LEFT and RIGHT forks. This is one way.

If a philospher wants to eat, he will put a semaphore for LEFT and RIGHT philosophers, provided both of them are not eating.

For the above two, I want to know which one will be efficient and better.

[Legend]

The first one sounds like the classical case that has a dead lock problem, doesn't it?

[Da_Maestro]

Either way is just as efficient.

Though with the semaphores per philosopher implementation you might get syncronisation problems...

Adam