True False on TSL(Test Set Lock)

Question

Which of the following is true/false Explain it.

1) TSL solution method is deadlock free.

2)TSL solution method is starvation  free.

3)TSL solution method process enter into fcfs order.

Answer 1

TSL is     deadlock free            True it is implemented for deadlock problem 

TSL solution method is starvation  free. False If there are multiple processes trying to get into their critical sections, there is no guarantee of what order they will enter, and any one process could have the bad luck to wait forever until they got their turn in the critical section. ( Since there is no guarantee as to the relative rates of the processes, a very fast process could theoretically release the lock, whip through their remainder section, and re-lock the lock before a slower process got a chance. As more and more processes are involved vying for the same resource, the odds of a slow process getting locked out completely increase. )

TSL solution method process enter into fcfs order. false by the same explanation

Comments

Considering a case :

suppose process P1 wants to enter the Critical Section, so it will first set the Lock to 1 (occupied) using TSL...now a Higher priority process P2 arrives due to which P1 got preempted by the OS.

Now out of P1 or P2 which will enter the CS?? it seems like a deadlock to me..
@Sanjay Sharma
@Shivam Chauhan

---

Preemption from CS and preemption from CPU are two different things. P1 will leave CS volunteerily

Answer 2

TSL method solution is deadlock free - True( because in TSL there might be a spin lock not dead lock).

TSL method solution is Starvation free - false (because it does not support bounded waiting)

TSL  solution method enters in fcfs order - false (because it depends on what type of scheduling you are using if you are using round robin then this might be true but in case if you are using any priority based scheduling then this condition might false)