Question

how is deadlock and starvation possible in test and set lock solution of M.E??

Comments

Starvation possible as it doesn't satisfy bounded waiting. But have never read so far if it isn't deadlock free. Deadlock is possible only when Lock = True when there is no process in C.S. but it never happens and Lock is always set to False initially. Deadlock only possible when Lock = True initially but it is highly insignificant. Can you please provide a reference ?

---

i do not have a refernce,was unable to find good explanantion but i had written this statement in my notes.

Answer 1

I think deadlock is not possible but starvation is possible.

Lock variable is independent. If a process is in CS and set the lock to 1, all the other process who want to go to CS will stuck at while loop, and because there is no FIFO the process which was earlier in CS will come back, then it can go again and agian to CS such that all other will starve.