This document presents algorithms for solving the producer-consumer problem using locks in NachOS. It includes code for a producer and consumer that each acquire locks before accessing a shared resource, and algorithms for testing the lock functionality, including for fairness, liveness, and safety. Safety is demonstrated by intentionally creating a deadlock between two locks to show they cannot be acquired simultaneously by different threads.

2. Richie

3. Jose Using: nachOS version 3.4 (c++) . Contents: 1) Algorithm for solving producer consumer problem using locks. 2) Algorithms for testing the locks functionallity.

4. Producer Consumer with locks. consumer(){ bool hasConsumerLock = false; while(1){ if(!hasConsumerLock){ consumerLock->Acquire(); hasConsumerLock = true; } if(products > 0){ changeProductsState->Acquire(); products--; changeProductsState->Release(); consumerLock->Release() hasConsumerLock = false; } } } producer(){ bool hasProducerLock = false; while(1){ if(!hasProducerLock){ producerLock->Acquire(); hasProducerLock = true; } if(products < maxProducts){ changeProductsState->Acquire(); products--; changeProductsState->Release(); producerLock->Release() hasProducerLock = false; } } } int maxProducts; int products; Lock *consumerLock; Lock *producerLock; Lock *changeProductsState;

5. Producer producer(){ bool hasProducerLock = false; while(1){ if(!hasProducerLock){ producerLock->Acquire(); hasProducerLock = true; } if(products < maxProducts){ changeProductsState->Acquire(); products++;//producing changeProductsState->Release(); producerLock->Release() hasProducerLock = false; } } }

6. Consumer consumer(){ bool hasConsumerLock = false; while(1){ if(!hasConsumerLock){ consumerLock->Acquire(); hasConsumerLock = true; } if(products > 0){ changeProductsState->Acquire(); p roducts--; //consuming changeProductsState->Release(); consumerLock->Release() hasConsumerLock = false; } } }

8. Safety Here the code produce a deadlock on porpuse to show that two locks can not have access to the same lock at the same time. Lock *l2; Lock *l3; Rutine1(){ while(1){ l2->Acquire(); l3->Acquire(); #some critical computation goes here l3->Release(); l2->Release(); } } Rutine2(){ while(1){ l3->Acquire(); l2->Acquire(); #some critical computation goes here l2->Release(); l3->Release() ; } }