Different Solutions to dining philosophers problem.
Answer / anubhav agrawal
One solution would be to banish a philosopher from the
table, thus emptying a seat. This leaves five chopsticks
for four people, so at least one of the philosophers will
be able to eat; thus, no deadlock. This means that each
system must have more resources available than tables, in
essence.
Another solution is to say that a philosopher can only pick
up chopsticks if both are available, and then only if the
neighbors are not going to pick them up. This is a
permissive style that causes some extra slowdown by adding
the step of permissions, but it keeps all of the
philosophers alive, which is the most important thing.
A third solution is an asymmetric one: number the
philosophers starting at an arbitrary chair and continuing
around the table. Then, a philosopher with an odd number
picks up the left chopstick and then the right, and the
even numbered philosophers pike up the right chopstick and
then the left. Thus, philosophers 2, 3, and 4 only can be
missing a pair if one of the two people at their sides are
actually eating (not just waiting), thus making sure a
deadlock is impossible.
There are countless more possible solutions to the dining-
philosophers problem. The primary factor in deciding if a
solution is good or not is to make sure that there are no
deadlocks or long pauses in the procedure; in other words,
a good solution makes sure a philosopher doesn't starve to
death.
Solutions to this problem show up regularly in all sorts of
areas, from biology to psychology to computer science. The
problem of synchronization is a fundamental one in our
world, and the dining-philosophers problem addresses it
simply, clearly, and directly
| Is This Answer Correct ? | 12 Yes | 0 No |
One of my friend told that M.C.A people are not prefered by the companies for networking side requirement is it true? please post your answer.because i want to make my career at networking side.
default route is analogous to ?
Which of the following is a language. A). QBE. B). SQL. C). QUEL. D). C
why does blue screen of death occurs while installing the windows XP or any other OS installation
Which one is not done by Data link layer ? 1. bit stuffing 2. LRC 3. CRC 4. parity check
How many types of Backups are there? Explain them in practical and theory?
how do u scan the client machine from server (AVG, McAfee & NAV)?
Explain Token ring
which are the institutes in mumbai for CCNA training & how much is the cost of teaching and the exam fees?
What is Antivirus?
what is firewall?
What is packet filter?