HOMEWORK 6 (COMMENTS AND COMMON MISTAKES)

Version 1 (Apr 11, 2007)

<< Problem 2 >>

o The big issue was not realizing that you need a mechanism to "match" one
  customer with one teller.  The solution does this with a critical region
  in the teller so that only one teller at a time can handshake with one
  customer.
    Also, some students use a spin lock and explicit queue to implement the
  above critical region, but a simple mutual exclusion semaphore is simpler.

<< Problem 5 >>

o The system is in a safe state only if you can show that all processes can
  finish execution.