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

I am using vm ware In my system and I am using 2003server in vm ware ( my o.s is XP ) Now I would like to install .zip in my 2003server machine .how can I do this

2159

---

Explain the advantage and disadvantage of ethernet ?

2497

---

whtch file system support the tcp/ip , http protocal and ftp protocal?

2345

---

what is disk interleaving? why is disk interleaving adopted?

2604

---

which is the latest version of dos? & what is the command to copy windows files (i386) without formatting OS?

2100

---

Differentiate between Baseband co-axial cable and broad band coaxial cable

1502

---

What is multicast routing

1232

---

What is count to infinity problem ?

1706

---

give an example of bus type network.

1178

---

I need to know the driver name associated with the DSN ? In java we can get it by using getDriverName()(implemented by 3rd party vendors.) method ? but i need the implemetation to get the driver name? so can u give me the code ? how to get the code ?

2662

---

what is scsi?. what we do if scsi/scsi drive failed?.

2376

---

hi , can you Suggest me the books (with author names) to learn Network programming from basics. Thanks in Advance... Prakash

1832

---

Subnet the class C network address 198.67.25.0 into eight subnets. Why are the ‘all ones’ and ‘all zeroes’ subnets not used ?

1865

---

In which of the 7 layers of OSI will a service handling conversion of characters is from EBCDIC to ASCII be normally implemented ?

1625

---

What is region

1205

---