Question

3. Consider the variation of the Dining Philosophers problem shown in Figure 6.17, where all unused chopsticks are placed in the center of the table and any philosopher can eat with any two chopsticks. One way to prevent deadlock in this system is to provide sufficient resources. For a system with n philosophers, what is the minimum number of chopsticks that ensures deadlock freedom? Why? Owned by Philosopher Waiting for hopsticks / Philosopher Philosopher Waiting for Owned by Owned by Philosopher Philosopher 3 Waiting for Waiting for Figure 6.17: Graph representation of the state of a Dining Philosophers system that includes a cycle among waiting threads and resources but that is d. Circles represent threads, boxes represent resources, dots within a box represent multiple instances of a resource, an arrow from a dot/resource instance to a circle/thread represents an owned by relationship and an arrow from a circle/thread to a box/resource represents a waiting for relationship

Answer 1

Given Situaction P hilosop hers Cousne Chopsthicks Pea Phi locaphess hng fpo Ci 3 C5 3 Si o, philosophe need t tuo chorsticks ince, in dining philesophes's pxablem hilosophex eeds two eat án -He given situaton, fo owned fyee to eat Afley the Pa complele ecting. chopsticks CC ave availabe for all othey philacophexs that a wtngo chopsticke The sea-una may followed a△

This one o the pass C) f Seauonco o complete eating 2 leava chopshcks ch is avaulable for tewauthng Asso mina, Pi ·tales c L fz. takes thus bath f and haue theu ana fea to it the chopsticks c' , cz.1C31C4 aje avaulable for the uiting philoso phers fs2 P4 ④ Pa has C5 and can take available chopstick anyone starts eatin a needs tss chopstides, can choose any od available chopstide start eain

Condlusion aiven situation, onl u chops ticles an begd to ao avoid deadlodle Thus,exi exiting ss tem is doadlocks fe Gieneralty, foN philosop hens to avoid deadlocke This is foy the case in which each philosophe has ouwned one choprticle