Different Solutions to dining philosophers problem.
Answer Posted / 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 |
Post New Answer View All Answers
Explain leaky bucket algorithm and compare it with token bucket algorithm.
Explain what is meant by the term ‘integrated service digital network’. Give three reasons a company might choose an ISDN link in preference to a leased line.
Why does ATM use the cell of small and fixed length ?
Explain Wireless networks.
Differentiate between Link state and Distance Vector Routing algorithm.
Differentiate between IEEE 802.3, IEEE 802.4 and IEEE 802.5 standards.
Outline and discuss the main fields in Ethernet IEEE 802.3 frame. What are the main objectives of preamble ?
What is count to infinity problem ?
what is scsi?. what we do if scsi/scsi drive failed?.
What do you mean by link to link layers of OSI reference model? Explain their functions briefly?
Write down the basic features of HDLC protocol? Could HDLC be used as a data link protocol for a LAN? Justify your answer.
What is Brouter (Bridge Router)
Discuss the following terms with respect to ATM: VPI, UNI, asynchronous, AAL, Cell, PVC.
what is the equivalent nx-os command for the "ip multicast-routing" ios command, and does the nexus 7000 support pim-sparse mode?
Why do data link layer protocols position the checksum in the trailer and not in the header ?