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 |
Give the equivalent binary word for the polynomial x8+x2+x+1.
Where will the deleted data stored when the Recycle Bin is full ?
Can we extend the range of Wifi with the use of some softwares, if yes, which one? Or is there any hardware to do so, how much will it cost?
Explain 1-persistent, p-persistent and 0-persistent CSMA giving strong and weak points of each.
_____________ is used to hold Cisco IOS software image
What is virtual channel
What does ‘data transparency’ mean ? With the help of a flow chart, explain the process of bit de-stuffing at the receiver’s end.
which is the latest versions of bluetooth & WiFi?
what is bluetooth?
FEW PORTS GET BLOCKED IN CISCO SWITCHES, CAN ANYONE TELL HOW TO UNBLOCK THIS PORTS
how many types of backups are there & explain them in theory mode & practical mode?
what is the name of the Jack used for Network Setup between one computer to Another and from computer to another device?