Critical section problem in Operating Systems - Mini Project: Build & Apply

Understanding the Critical Section Problem

📖 Scenario: You are learning about how multiple processes share resources in a computer system. Imagine two people trying to use the same printer at the same time. Without rules, their print jobs could get mixed up. This is similar to the critical section problem in operating systems.

🎯 Goal: Build a simple step-by-step explanation and example of the critical section problem using a shared variable and how to control access to it.

📋 What You'll Learn

Create a shared resource variable representing a counter

Add a flag variable to indicate if the resource is in use

Write a simple loop to simulate processes trying to enter the critical section

Add a final statement showing how the critical section is protected

💡 Why This Matters

🌍 Real World

In real computers, many programs run at the same time and share resources like printers, files, or memory. The critical section problem helps prevent errors when these programs try to use the same resource.

💼 Career

Understanding the critical section problem is important for software developers, system programmers, and anyone working with concurrent or parallel systems to write safe and reliable code.

1

Create the shared resource variable

Create a variable called shared_counter and set it to 0. This will represent the shared resource that processes want to access.

Operating Systems

# Create the shared resource variable
# Your code here

Hint

Think of shared_counter as a number that multiple processes want to increase.

2

Add a flag to indicate resource usage

Create a variable called resource_in_use and set it to False. This flag will show if the shared resource is currently being used by a process.

Operating Systems

shared_counter = 0
# Create a flag variable to indicate if the resource is in use
# Your code here

Hint

This flag helps processes know if they can safely use the shared resource.

3

Simulate processes trying to enter the critical section

Write a for loop with the variable process iterating over range(3). Inside the loop, write an if statement that checks if resource_in_use is False. If so, set resource_in_use to True and increase shared_counter by 1. Then set resource_in_use back to False.

Operating Systems

shared_counter = 0
resource_in_use = False
# Simulate processes trying to enter the critical section
# Your code here

Hint

This simulates three processes trying to use the shared resource one after another safely.

4

Add a final comment explaining the critical section protection

Add a comment line explaining that setting resource_in_use to True protects the critical section so only one process uses the shared resource at a time.

Operating Systems

shared_counter = 0
resource_in_use = False
for process in range(3):
    if resource_in_use == False:
        resource_in_use = True
        shared_counter += 1
        resource_in_use = False
# Add a comment explaining critical section protection here

Hint

This comment helps explain why the flag is important for safe resource sharing.

Practice

1. What is the main goal of the critical section problem in operating systems?

easy

A. To ensure only one process accesses shared resources at a time

B. To allow multiple processes to access resources simultaneously

C. To speed up the execution of all processes

D. To prevent processes from running in parallel

Solution

1. Step 1: Understand the critical section concept

   The critical section is a part of the program where shared resources are accessed.

2. Step 2: Identify the problem goal

   The goal is to prevent multiple processes from entering the critical section simultaneously to avoid conflicts.

3. Final Answer:

   To ensure only one process accesses shared resources at a time -> Option A

4. Quick Check:

   Critical section = exclusive access [OK]

Hint: Only one process can be inside critical section at once [OK]

Common Mistakes:

• Thinking multiple processes can safely access shared data simultaneously
• Confusing critical section with process scheduling
• Believing critical section speeds up all processes

2. Which of the following is a correct way to indicate a process is in its critical section using a flag variable flag[i]?

easy

A. flag[i] = true

B. flag[i] = -1

C. flag[i] = 0

D. flag[i] = false

Solution

1. Step 1: Understand flag usage in critical section

   A flag variable is often used to indicate if a process wants to enter or is inside the critical section.

2. Step 2: Identify correct flag value for 'in critical section'

   Setting flag[i] = true means the process is active or wants to enter the critical section.

3. Final Answer:

   flag[i] = true -> Option A

4. Quick Check:

   Flag true means process active [OK]

Hint: True means process wants or is inside critical section [OK]

Common Mistakes:

• Using 0 or false to indicate active process
• Confusing flag values with process IDs
• Using negative values for flags

3. Consider this pseudocode for two processes P0 and P1 using flags to enter critical section:

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

What happens if both processes set their flags to true at the same time?

medium

A. Both enter critical section simultaneously

B. Both skip critical section

C. Both wait forever (deadlock)

D. One waits while the other enters critical section

Solution

1. Step 1: Analyze the waiting condition

   Each process waits while the other's flag is true, so if both flags are true simultaneously, both wait.

2. Step 2: Identify the outcome

   Since both wait for the other to clear their flag, neither proceeds, causing deadlock.

3. Final Answer:

   Both wait forever (deadlock) -> Option C

4. Quick Check:

   Both flags true = deadlock [OK]

Hint: Both flags true means both wait forever [OK]

Common Mistakes:

• Assuming both can enter critical section simultaneously
• Thinking one process always proceeds first
• Ignoring the waiting loop condition

4. In the following code snippet, what is the main error that can cause the critical section problem?

flag[i] = true
while(flag[j]) {
  // do nothing
}
// critical section
flag[i] = false

Assuming two processes P0 and P1 use this code with i=0, j=1 and vice versa.

medium

A. Infinite loop if flag[j] is false

B. No mutual exclusion, both can enter critical section

C. Flag reset happens before critical section

D. Deadlock if both set flag true simultaneously

Solution

1. Step 1: Understand the waiting condition

   Each process waits while the other process's flag is true.

2. Step 2: Identify the error scenario

   If both processes set their flags to true simultaneously, both wait forever, causing deadlock.

3. Final Answer:

   Deadlock if both set flag true simultaneously -> Option D

4. Quick Check:

   Simultaneous flags true = deadlock [OK]

Hint: Both flags true causes deadlock, not mutual exclusion [OK]

Common Mistakes:

• Thinking both can enter critical section simultaneously
• Believing flag reset is before critical section
• Assuming infinite loop if flag[j] is false

5. Which of the following solutions correctly solves the critical section problem by ensuring mutual exclusion, progress, and bounded waiting?

hard

A. Using a simple flag variable without turn variable

B. Peterson's algorithm using flags and turn variable

C. Both processes entering critical section simultaneously

D. Ignoring synchronization and relying on process speed

Solution

1. Step 1: Review solution requirements

   The solution must ensure mutual exclusion, progress, and bounded waiting to solve the critical section problem correctly.

2. Step 2: Evaluate each option

   Using a simple flag variable without turn variable lacks a turn variable, so it can cause deadlock or starvation. Peterson's algorithm using flags and turn variable uses flags and turn to guarantee all three conditions. The other options are incorrect approaches.

3. Final Answer:

   Peterson's algorithm using flags and turn variable -> Option B

4. Quick Check:

   Peterson's algorithm = correct solution [OK]

Hint: Peterson's algorithm uses flags + turn for safe access [OK]

Common Mistakes:

• Ignoring the need for a turn variable
• Assuming simple flags are enough
• Believing processes can safely ignore synchronization