Peterson's solution in Operating Systems - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding the purpose of Peterson's solution

What is the main goal of Peterson's solution in operating systems?

A To ensure mutual exclusion between two processes accessing a shared resource

B To increase the speed of process execution by parallelizing tasks

C To allocate memory dynamically to processes

D To schedule processes based on priority levels

💡 Hint

Think about what problem arises when two processes try to use the same resource at the same time.

Peterson's solution is a classic algorithm designed to ensure that two processes do not enter their critical sections simultaneously, thus achieving mutual exclusion.

📋 Factual

intermediate

Key variables in Peterson's solution

Which two shared variables are used in Peterson's solution to coordinate access between two processes?

A "semaphore" and "mutex"

B "priority" variable and "state" array

C "lock" variable and "counter" variable

D "flag[]" array and "turn" variable

💡 Hint

One variable indicates if a process wants to enter the critical section, and the other decides whose turn it is.

Peterson's solution uses a boolean array "flag[]" where each process sets its intent to enter the critical section, and a "turn" variable to decide which process gets priority.

🔍 Analysis

advanced

Analyzing Peterson's solution for deadlock

Does Peterson's solution allow deadlock to occur? Why or why not?

A No, because it uses semaphores to prevent deadlock

B Yes, because both processes can wait indefinitely if they set their flags simultaneously

C No, because the "turn" variable ensures that one process will always proceed if both want to enter the critical section

D Yes, because it does not handle process priorities

💡 Hint

Consider how the "turn" variable helps break ties when both processes want to enter.

Peterson's solution prevents deadlock by using the "turn" variable to give priority to one process, ensuring that if both want to enter, one will proceed while the other waits.

❓ Comparison

advanced

Peterson's solution vs. hardware-based locking

Compared to hardware-based locking mechanisms like test-and-set, what is a limitation of Peterson's solution?

A It requires special CPU instructions to function

B It only works correctly for two processes and relies on strict memory ordering

C It can handle multiple processes without any modification

D It guarantees fairness without any waiting

💡 Hint

Think about the number of processes and hardware requirements.

Peterson's solution is designed for exactly two processes and assumes sequential consistency in memory operations, which may not hold on modern hardware without additional memory barriers.

❓ Reasoning

expert

Why Peterson's solution is not widely used in modern systems

Despite its correctness, why is Peterson's solution rarely used in real-world operating systems today?

A Because modern CPUs have relaxed memory models that can break its assumptions without explicit memory barriers

B Because it causes deadlocks in multi-threaded environments

C Because it requires too much memory to store flags for each process

D Because it only works on single-core processors

💡 Hint

Consider how modern CPU architectures handle memory operations.

Modern CPUs often reorder memory operations for performance, which can break the assumptions Peterson's solution relies on unless special memory barriers are used, making it impractical for real systems.