Operating Systems - Critical Section Problem - Requirements & Peterson's Solution
Which of the following is a key limitation of Peterson's algorithm that affects its practical use in modern multiprocessor systems?
Which of the following is a key limitation of Peterson's algorithm that affects its practical use in modern multiprocessor systems?
medium🪤 Complexity Trap Q13 of Q15
Step-by-Step Solution
Step 1: Identify Peterson's algorithm characteristics
Peterson's algorithm uses busy waiting (spinlock), which can waste CPU resources.Step 2: Analyze other options
It cannot guarantee mutual exclusion under any circumstances is false because mutual exclusion is guaranteed. It depends on hardware atomic instructions to function correctly is incorrect since Peterson's algorithm was designed to avoid hardware atomic instructions. It allows unbounded waiting, leading to starvation is wrong because bounded waiting is guaranteed.Final Answer:
Option B -> Option BQuick Check:
Busy waiting is a known practical limitation of Peterson's algorithm.
Quick Trick: Peterson's = busy waiting, no hardware locks, bounded waiting
Common Mistakes:
MISTAKES- Assuming Peterson's needs hardware atomic instructions
- Confusing bounded waiting with starvation
- Believing mutual exclusion can fail
Trap Explanation:
PITFALL- Option C is tempting because many synchronization algorithms rely on atomic instructions. Option D confuses starvation with bounded waiting. Option B contradicts the fundamental guarantee of Peterson's algorithm.
Interviewer Note:
CONTEXT- Tests understanding of practical trade-offs and limitations of Peterson's algorithm.
Master "Critical Section Problem - Requirements & Peterson's Solution" in Operating Systems
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore Operating Systems Quizzes