Issues addressed by this lab include:

• Practice reading code using Pthreads
• Practice using Pthread mutexes
• Practice using Pthread condition variables
• Practice analyzing concurrency control problems

1. Slides
2. Lab Files
3. Video Discussion
   
   
   
   

Modify the starter code to prevent deadlock using two methods:
(1) asymmetric locking order in different philosophers and
(2) use of a Pthreads condition variable to simulate the presence of a waiter that will give both or neither of the chopsticks to a philosopher in an atomic operation.

You need to zip up your lab for submission. For this step, you should use the 'zip' target included in the lab's Makefile. Change the STUDENT_ID variable in the Makefile to your student ID and type:

    make zip

Please ensure that you have checked your final solution on the cycle servers before submission.  

• dp_asymmetric - 35%
• dp_waiter - 40%
• In-class Quiz - 10%
• Demo - 15%

< Back to the Lab Home Page