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 is an operating system on a computer?

0 Answers  


Does chkdsk erase data?

0 Answers  


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

1 Answers  


Which is the best page replacement algorithm and Why? How

0 Answers  


What is lock granularity?

1 Answers   IBM,


What are merits and demerits of systems supporting multiple file structure and systems supporting a stream of bytes?

0 Answers  


Explain about compiler and the functions executed by them?

0 Answers  


What is a critical section?

0 Answers  


What is root partition?

0 Answers  


How does a ram function?

0 Answers  


How do I find a file path on a mac?

0 Answers  


How do I know chkdsk is finished?

0 Answers  


Categories