Question

Dining Philosophers Problem:

I need explanation with the following implementation

	Starvation?	Deadlock?
Spin lock
Semaphore with queues

Answer 1

Answer:

(a) if we implement dinning philosopher using locking protocol then suppose more than two philosophers are waiting for eating to get the chopstick all waiting philosopher is continuously checking the locks which cause busy waiting and as well as known as spin-lock but there is no chance of deadlock with the correct solution of dinning philosopher but there is chance of starvation because suppose if both philosophers are waiting and continuously checking the lock if philosopher 1 one get chance of getting chopstick then philosopher 2 still waits in spin-lock now again the recent philosopher willing to eat then again they will also check the lock now suppose philosopher 1 release chopstick then there might be chance that philosopher 3 will get chopstick but still philosopher2 in waiting for state such situation leads starvation but not deadlock.

b) The second solution is semaphore in queue order which will have neither deadlock nor starvation because semaphore has been introduced to get rid of a spinlock.

DEAR PLEASE DO RATE THE ANSWER IF HELPS ELSE LET ME KNOW YOUR DOUBTS IN COMMENTS (HAPPY TO HELP).

THANK YOU!!!