(Latest Revision: Sun Mar 22, 2020 )
cs3750q6Recap.txt
cs3750q6Recap.txt
Section 001 Quiz #6 Answer Information
What you needed to know for each question
- When is it possible for a process to be interrupted?
- What is the wording of the Mutual Exclusion Requirement?
- What shared data is used by Peterson's Solution?
- What does it mean to say that an operation executes atomically?
- What is busy waiting?
- 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
- What is the problem of potential interleaving of the instruction
of concurrent processes?
- What is the wording of the Bounded Waiting requirement?
- What exactly is Peterson's Solution good for? What are its limitations,
advantages and disadvantages, relative to other tools?
- What are the properties of atomic hardware instructions? For those
instructions, what does "atomic" mean?
- What is a spinlock? Under what circumstances should a spinlock be used?
- For a counting semaphore, what does the wait() operation do
to the data within the semaphore (the value and the list fields)?