Problems, S Problems: The Dinning Philosopher's Problem

752 Words4 Pages
The Dining Philosopher’s Problem: The dinning philosopher problem describe the group of philosopher sitting on a round table doing one of two thing either eating or thinking we assume that there is five philosopher as an example. So there are five philosophers and they have five food plates. There are 5 philosophers are present in that room and they think more and more even when they feel hungry then they think much more. And each have the fork on both side of the plates and when a philosopher pick a fork from both side then the other philosopher is waiting condition when that philosopher is free and its turn come. From above example if philosophers took up their forks on the right side of him and wait for the left one it ma y cause deadlock. The lake of solution must be gave the idea that any philosopher must b thinking and other may use its fork to eat because it is must that every philosopher have two forks to eat, then the philosopher is affected by a condition called resource starvation. Solution of this problem is dijkstra algorithm it assign the resources in partial order and established in a way that as resources are requested for other. Here the number of forks will bw 1 to 5 and each philosopher should pick the lowest and highest rank of fork The other ways to solve dining philosopher is Arbitrator solution and Candy/Misra Solution. The Readers-Writers Problem: Consider in this problem we have one file that is used to read by many people If one of them

    More about Problems, S Problems: The Dinning Philosopher's Problem

      Open Document