Operating Systems - Critical Section Problem - Requirements & Peterson's Solution
If Peterson's algorithm is extended to more than two processes by using a turn array and flags, what is a key challenge that arises?
If Peterson's algorithm is extended to more than two processes by using a turn array and flags, what is a key challenge that arises?
hard🎤 Interviewer Follow-up Q10 of Q15
Step-by-Step Solution
Solution:
Step 1: Understand Peterson's algorithm extension
Extending to n processes requires managing multiple turn variables and flags.Step 2: Analyze challenges
Ensuring progress becomes complex because turn management must prevent circular waiting and starvation.Step 3: Evaluate other options
Mutual exclusion can still be maintained with careful design, so B is wrong. Bounded waiting is not trivial, so C is wrong. Deadlock can still occur if turn management fails, so A is wrong.Final Answer:
Option B -> Option BQuick Check:
Progress guarantee is challenging with multiple processes [OK]
Quick Trick: Progress guarantee is hardest to maintain with many processes [OK]
Common Mistakes:
MISTAKES- Assuming mutual exclusion is lost
- Believing bounded waiting is trivial
- Ignoring deadlock possibility
Trap Explanation:
PITFALL- Candidates often underestimate complexity of progress and turn management in multi-process extensions.
Interviewer Note:
CONTEXT- Tests deep understanding of limitations when scaling 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