Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


What are your solution strategies for "Dining Philosophers
Problem" ?



What are your solution strategies for "Dining Philosophers Problem" ?..

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

Post New Answer

More Operating Systems General Concepts Interview Questions

What are ddks?

0 Answers  


Describe Operating system?

0 Answers   Aricent,


What are the functions of the ram ic`s?

0 Answers  


Is it safe to delete ost file?

0 Answers  


What is Concurrency? Expain with example Deadlock and Starvation?

5 Answers   Wipro,


Tell me if you know how are the wait/signal operations for monitor different from those for semaphores?

0 Answers  


Difference between short term, long term and medium term scheduler.

0 Answers   Tech Mahindra,


What are dynamic loading?

0 Answers  


What is a 32 bit integer?

0 Answers  


Can x86 run 64 bit?

0 Answers  


What do you mean by Belady's Anomaly. - Describe with example.

4 Answers   IBM,


what are Demand paging, page faults, replacement algorithms, thrashing

1 Answers  


Categories