recategorized by
3,534 views
2 votes
2 votes

Dining Philosopher's problem is a

  1. Producer - consumer problem
  2. Classical IPC problem
  3. Starvation problem
  4. Synchronization primitive
recategorized by

2 Answers

Best answer
2 votes
2 votes

Answer must be B

The simple description of the problem:

  • Five silent philosophers sit at a round table with bowls of spaghetti.Forks are placed between each pair of adjacent philosophers.
  • Each philosopher must alternately think and eat.
  • However, a philosopher can only eat spaghetti when he has both left and right forks.
  • Each fork can be held by only one philosopher and so a philosopher can use the fork only if it is not being used by another philosopher.
  • After he finishes eating, he needs to put down both forks so they become available to others.
  • A philosopher can take the fork on his right or the one on his left as they become available, but cannot start eating before getting both of them.
  • Eating is not limited by the remaining amounts of spaghetti or stomach space; an infinite supply and an infinite demand are assumed.
  • The problem is how to design a discipline of behavior (a concurrent algorithm) such that no philosopher will starve; i.e., each can forever continue to alternate between eating and thinking, assuming that no philosopher can know when others may want to eat or think.
edited by
Answer:

Related questions

3 votes
3 votes
1 answer
1
go_editor asked Aug 2, 2016
2,558 views
Match the following for UNIX system calls :$\begin{array}{clcl} &\textbf{List-I} && \textbf{List-II} \\ \text{(a)} & \text{exec} & \text{(i)} & \text{Creates new process...
2 votes
2 votes
1 answer
2
go_editor asked Aug 1, 2016
2,767 views
A unix file may be of the typeRegular fileDirectory fileDevice fileAny one of the above
4 votes
4 votes
2 answers
3
go_editor asked Aug 1, 2016
3,840 views
In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easyIndexLinkedContiguousBit Map