Peterson's solution in Operating Systems - Mini Project: Build & Apply

Peterson's Solution for Mutual Exclusion

📖 Scenario: You are learning how two processes can share a resource without interfering with each other. Peterson's solution is a simple way to make sure only one process uses the resource at a time.

🎯 Goal: Build a step-by-step understanding of Peterson's solution by creating the key variables and logic that allow two processes to take turns accessing a shared resource safely.

📋 What You'll Learn

Create two boolean flags to indicate if each process wants to enter the critical section

Create a variable to indicate which process's turn it is

Write the entry protocol logic for one process using Peterson's solution

Write the exit protocol logic for the same process to release the critical section

💡 Why This Matters

🌍 Real World

Peterson's solution is a classic example used to teach how two processes can share resources safely without conflicts.

💼 Career

Understanding mutual exclusion is important for software developers and system programmers who work with concurrent or parallel programs.

1

DATA SETUP: Create the flags for process interest

Create two boolean variables called flag0 and flag1 and set both to False. These flags show if process 0 or process 1 wants to enter the critical section.

Operating Systems

# Create two boolean flags for process interest
# Your code here

Need a hint?

Think of flag0 and flag1 as signals from each process saying 'I want to enter'.

2

CONFIGURATION: Create the turn variable

Add a variable called turn and set it to 0. This variable will show whose turn it is to enter the critical section.

Operating Systems

flag0 = False
flag1 = False
# Create a variable to indicate which process's turn it is
# Your code here

Need a hint?

The turn variable helps the processes take turns fairly.

3

CORE LOGIC: Write the entry protocol for process 0

Write the entry protocol for process 0 using Peterson's solution. Set flag0 = True to show process 0 wants to enter. Set turn = 1 to give process 1 the chance. Then use a while loop that waits while flag1 is True and turn is 1.

Operating Systems

flag0 = False
flag1 = False
turn = 0
# Write entry protocol for process 0
# Your code here

Need a hint?

This logic makes process 0 wait if process 1 wants to enter and it is process 1's turn.

4

COMPLETION: Write the exit protocol for process 0

Write the exit protocol for process 0 by setting flag0 = False. This shows process 0 is leaving the critical section and lets process 1 enter if it wants.

Operating Systems

flag0 = False
flag1 = False
turn = 0
flag0 = True
turn = 1
while flag1 and turn == 1:
    pass
# Write exit protocol for process 0
# Your code here

Need a hint?

Setting flag0 to False signals that process 0 is done using the shared resource.