# [HACKERS] Lock and Waiters

I have question on Locks and waiting.

Each waiter is awoken if (a) its request
does not conflict with already-granted locks, and (b) its request does
not conflict with the requests of prior un-wakable waiters.

Let us imagine if there is Process P which is holding a lock and there are individual waiters p1 p2 p3 p4 p5 p6 requiring the same lock. Now since they are in conflict it is sure that there will be wait queue that will get generated as in p1 p2 p3 p4 p5 p6.
Imagine if Process P releases it lock. As per explaination given in (a) it is sure that p1 will wake up. What is the status of p2. It was in conflict with process P and hence should we term it that it will not wake up. Same is the case with p2 ... p6.

Under what circumstance will p2 be also woken up taking into consideration that the lock held by process P is released.
Secondly if p2 is not woken up and if p3's lock doesn't conflict with  ( P and p2 ) then by rule(b) will p3 move ahead  of p2

Thanks,
Kenneth