1. Describe how the compare and swap() instruction can be used to pro- vide mutual exclusion that satisfies the bounded-waiting requirement.

2. Windows Vista provides a lightweight synchronization tool called slim readerwriter locks. Whereas most implementations of readerwriter locks favor either readers or writers, or perhaps order waiting threads using a FIFO policy, slim readerwriter locks favor neither readers nor writers, nor are waiting threads ordered in a FIFO queue. Explain the benefits of providing such a synchronization tool.

3.Design an algorithm for a bounded-buffer monitor in which the buffers (portions) are embedded within the monitor itself.