Peterson's solution in Operating Systems - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is Peterson's solution used for in operating systems?

Peterson's solution is a method to ensure mutual exclusion, allowing two processes to share a single-use resource without conflicts or interference.

beginner

Which two key variables does Peterson's solution use to control access?

It uses a 'flag' array to indicate if a process wants to enter the critical section and a 'turn' variable to decide which process's turn it is to enter.

intermediate

How does Peterson's solution prevent both processes from entering the critical section at the same time?

By setting its own flag to true and giving the turn to the other process, a process waits if the other wants to enter and it is the other’s turn, ensuring only one enters at a time.

intermediate

What are the three main properties Peterson's solution guarantees?

Mutual exclusion (only one process in critical section), progress (no process waits forever if the critical section is free), and bounded waiting (each process gets a chance eventually).

advanced

Why is Peterson's solution mostly of theoretical interest today?

Because it requires strict assumptions like sequential consistency of memory operations, which modern processors and compilers may not guarantee, making it less practical for real systems.

What does the 'turn' variable in Peterson's solution represent?

A The total number of processes waiting

B The number of times a process has entered the critical section

C The priority level of a process

D Which process's turn it is to enter the critical section

The 'turn' variable indicates which process is allowed to enter the critical section next.

How many processes can Peterson's solution handle simultaneously?

A Any number of processes

B Only two processes

C Exactly three processes

D Only one process

Peterson's solution is designed specifically for two processes.

Which property ensures that no process waits forever in Peterson's solution?

A Bounded waiting

B Progress

C Mutual exclusion

D Deadlock

Bounded waiting guarantees that each process will eventually enter the critical section.

What happens if both processes set their flags to true and the turn variable is set to one process?

A The process that set its flag first enters

B Both processes enter simultaneously

C The process whose turn it is enters the critical section

D Neither process enters

The process whose turn it is allowed to enter the critical section proceeds, ensuring mutual exclusion.

Why might Peterson's solution fail on modern processors?

A Because modern processors reorder instructions affecting memory consistency

B Because it uses too much memory

C Because it only works with three or more processes

D Because it requires special hardware

Modern processors may reorder instructions, breaking the assumptions Peterson's solution relies on.

Explain how Peterson's solution uses the 'flag' array and 'turn' variable to achieve mutual exclusion.

Think about how a process signals it wants to enter and how it respects the other process's turn.

Describe the main limitations of Peterson's solution in practical operating systems.

Consider hardware and system behavior differences from the original assumptions.

Practice

1. What is the main purpose of Peterson's solution in operating systems?

easy

A. To prevent two processes from accessing a shared resource simultaneously

B. To increase the speed of process execution

C. To allocate memory to processes

D. To schedule processes based on priority

Solution

1. Step 1: Understand the problem Peterson's solution addresses

   Peterson's solution is designed to handle the critical section problem where two processes must not access a shared resource at the same time.

2. Step 2: Identify the main goal of the solution

   The main goal is to ensure mutual exclusion, preventing simultaneous access to shared resources.

3. Final Answer:

   To prevent two processes from accessing a shared resource simultaneously -> Option A

4. Quick Check:

   Mutual exclusion = Prevent simultaneous access [OK]

Hint: Peterson's solution controls access to shared resources [OK]

Common Mistakes:

• Confusing it with process scheduling
• Thinking it manages memory allocation
• Assuming it increases execution speed

2. Which of the following variables is NOT used in Peterson's solution?

easy

A. flag

B. turn

C. counter

D. process_id

Solution

1. Step 1: Recall the variables used in Peterson's solution

   Peterson's solution uses two flags (one per process) and a turn variable to control access.

2. Step 2: Identify the variable not part of the solution

   The variable 'counter' is not used in Peterson's solution; it is unrelated to mutual exclusion control.

3. Final Answer:

   counter -> Option C

4. Quick Check:

   Variables used = flag, turn; counter not used [OK]

Hint: Remember only flag and turn variables are used [OK]

Common Mistakes:

• Assuming process_id is a variable in Peterson's solution
• Confusing counter with flag
• Thinking turn is a counter

3. Consider two processes P0 and P1 using Peterson's solution. If both set their flags to true and turn to 1, which process will enter the critical section first?

medium

A. P0

B. P1

C. Both enter simultaneously

D. Neither enters

Solution

1. Step 1: Analyze the turn variable's role

   The turn variable indicates which process's turn it is to enter the critical section when both want access.

2. Step 2: Apply the given values

   Both flags are true, meaning both want to enter. Since turn is set to 1, process P1 has priority to enter first.

3. Final Answer:

   P1 -> Option B

4. Quick Check:

   Turn = 1 means P1 enters first [OK]

Hint: Turn variable decides which process enters first [OK]

Common Mistakes:

• Assuming both enter simultaneously
• Ignoring the turn variable
• Thinking the first flag set enters first

4. Identify the error in this Peterson's solution snippet for process P0:

flag[0] = true;
turn = 1;
while(flag[1] && turn == 1) {
  // wait
}
// critical section
flag[0] = false;

medium

A. No error; this is correct Peterson's solution code

B. turn should be set to 0 instead of 1

C. flag[0] should be set to false before the while loop

D. The while condition should use OR instead of AND

Solution

1. Step 1: Review the Peterson's solution steps for process P0

   Process P0 sets its flag true, sets turn to the other process (1), then waits while the other process wants to enter and it's their turn.

2. Step 2: Check the correctness of the code snippet

   The code correctly implements the waiting condition and resets the flag after the critical section.

3. Final Answer:

   No error; this is correct Peterson's solution code -> Option A

4. Quick Check:

   Code matches Peterson's solution pattern [OK]

Hint: Check waiting condition and flag reset carefully [OK]

Common Mistakes:

• Changing turn to own process instead of other
• Misplacing flag reset before critical section
• Using OR instead of AND in while condition

5. How does Peterson's solution ensure fairness between two processes competing for a critical section?

hard

A. By allowing the process with higher priority to enter first

B. By locking the resource permanently for the first process

C. By using a random number generator to decide access

D. By using a turn variable to alternate access between processes

Solution

1. Step 1: Understand fairness in Peterson's solution

   Fairness means no process waits forever; both get a chance to enter the critical section.

2. Step 2: Identify how fairness is implemented

   The turn variable ensures that if both processes want access, the one whose turn it is gets priority, then the turn switches, alternating access.

3. Final Answer:

   By using a turn variable to alternate access between processes -> Option D

4. Quick Check:

   Turn variable alternates access = fairness [OK]

Hint: Turn variable alternates access to ensure fairness [OK]

Common Mistakes:

• Thinking priority decides access
• Assuming random choice controls fairness
• Believing resource is locked permanently