What are your solution strategies for "Dining Philosophers
Problem" ?
- 1 Answers
- 6267 Views
- I also Faced
- E-Mail Answers
Answer / neena lekshmi p s
the dining philosophers problem is an illustrative example
of a common computing problem in concurrency. It is a
classic multi-process synchronization problem.
The dining philosophers problem is
summarized as five philosophers sitting at a table doing one
of two things: eating or thinking. While eating, they are
not thinking, and while thinking, they are not eating. The
five philosophers sit at a circular table with a large bowl
of spaghetti in the center. A fork is placed in between each
pair of adjacent philosophers, and as such, each philosopher
has one fork to his left and one fork to his right. As
spaghetti is difficult to serve and eat with a single fork,
it is assumed that a philosopher must eat with two forks.
Each philosopher can only use the forks on his immediate
left and immediate right.
The dining philosophers problem is
sometimes explained using rice and chopsticks rather than
spaghetti and forks, as it is more intuitively obvious that
two chopsticks are required to begin eating.
The philosophers never speak to each other, which creates a
dangerous possibility of deadlock when every philosopher
holds a left fork and waits perpetually for a right fork (or
vice versa).
Originally used as a means of illustrating the problem of
deadlock, this system reaches deadlock when there is a
'cycle of unwarranted requests'. In this case philosopher P1
waits for the fork grabbed by philosopher P2 who is waiting
for the fork of philosopher P3 and so forth, making a
circular chain.
| Is This Answer Correct ? | 2 Yes | 9 No |
Explain Memory Partitioning, Paging, Segmentation?
Define paging and deadlock.
Is operating system a software?
What are the three types of operating systems?
What is the Translation Lookaside Buffer (TLB)?
Explain the handheld systems.
Suppose if we have a variable 'I' in run method, if I can create one or more thread each thread will occupy a separate copy or same variable will be shared?
What is a phase change memory?
What are the different types package forms?
What do you understand by transaction atomicity?
Measurements of a certain system have shown that the average process runs for a time T before blocking on I/O. A process switch requires a time S, which is effectively wasted (overhead). The CPU’s efficiency is the fraction of its time its spends executing user programs, i.e., executing user processes. For round robin scheduling with quantum Q, give a formula for the CPU efficiency for each of the following: (a) Q = ∞ (b) Q > S + T (c) S <Q<S + T (d) Q = S
How are the wait or signal operations for monitor different from those for semaphores?
Windows 
