Prove that the Composite Fast Path Lock implementation guarantees mutual exclusion, but is not starvation-free. Exercise Design an is Locked()method that tests whether any thread is holding a lock...

Prove that the Composite Fast Path Lock implementation guarantees mutual exclusion, but is not starvation-free. Exercise Design an is Locked()method that tests whether any thread is holding a lock (but does not acquire the lock). Give implementations for

• a test-and-set spin lock,

• the CLH queue lock, and

• the MCS queue lock.