(Latest Revision: Sun Mar 22, 2020 ) cs3750q6Recap.txt

cs3750q6Recap.txt


Section 001 Quiz #6 Answer Information

What you needed to know for each question
  1. When is it possible for a process to be interrupted?
  2. What is the wording of the Mutual Exclusion Requirement?
  3. What shared data is used by Peterson's Solution?
  4. What does it mean to say that an operation executes atomically?
  5. What is busy waiting?
  6. For a counting semaphore, what does the signal() operation do to the data within the semaphore (the value and the list fields)?

Section 003 Quiz #6 Answer Information

What you needed to know for each question
  1. What is the problem of potential interleaving of the instruction of concurrent processes?
  2. What is the wording of the Bounded Waiting requirement?
  3. What exactly is Peterson's Solution good for? What are its limitations, advantages and disadvantages, relative to other tools?
  4. What are the properties of atomic hardware instructions? For those instructions, what does "atomic" mean?
  5. What is a spinlock? Under what circumstances should a spinlock be used?
  6. For a counting semaphore, what does the wait() operation do to the data within the semaphore (the value and the list fields)?