Critical section problem in Operating Systems - Step-by-Step Execution

Concept Flow - Critical section problem

Process wants to enter CS

↓

Check if CS is free

↓

Enter CS

↓

Execute CS code

↓

Exit CS

↓

Allow others to enter

The flow shows a process checking if the critical section (CS) is free, entering if yes, or waiting if no, then executing and exiting the CS to allow others.

Execution Sample

Operating Systems

Process 1:
while (true) {
  wait(); // wait for CS
  critical_section();
  signal(); // release CS
}

This code shows a process repeatedly trying to enter the critical section by waiting, executing, and then signaling release.

Analysis Table

Step	Process	CS Status	Action	Result
1	P1	Free	Check CS	CS is free, enter CS
2	P1	Occupied	Execute CS	Process P1 is in CS
3	P2	Occupied	Check CS	CS is occupied, wait
4	P1	Occupied	Exit CS	CS becomes free
5	P2	Free	Check CS	CS is free, enter CS
6	P2	Occupied	Execute CS	Process P2 is in CS
7	P2	Occupied	Exit CS	CS becomes free
8	P3	Free	Check CS	CS is free, enter CS
9	P3	Occupied	Execute CS	Process P3 is in CS
10	P3	Occupied	Exit CS	CS becomes free
11	-	Free	Check CS	No process waiting, system idle

💡 Processes take turns entering CS; when no process wants CS, it remains free.

State Tracker

Variable	Start	After Step 1	After Step 4	After Step 7	After Step 10	Final
CS Status	Free	Occupied by P1	Free	Free	Free	Free
Waiting Queue	Empty	Empty	P2 waiting	Empty	Empty	Empty

Key Insights - 3 Insights

Why does Process 2 have to wait at Step 3 even though Process 1 is almost done?

Because the critical section is still occupied by Process 1 at Step 3, Process 2 must wait until Process 1 exits (Step 4) before entering, as shown in the execution_table.

What happens if a process exits the critical section but no other process is waiting?

The critical section remains free and idle, as seen at Step 11 in the execution_table where no process is waiting and CS is free.

How does the system ensure only one process is in the critical section at a time?

By checking the CS status before entering and making processes wait if occupied, the system enforces mutual exclusion, demonstrated by the alternating CS Status in the execution_table.

Visual Quiz - 3 Questions

Look at the execution_table at Step 3. What is the status of the critical section?

A Unknown

B Free

C Occupied

D Being released

💡 Hint

Refer to the 'CS Status' column at Step 3 in the execution_table.

At which step does Process 2 enter the critical section?

A Step 2

B Step 5

C Step 7

D Step 3

💡 Hint

Check the 'Action' and 'Result' columns for Process 2 in the execution_table.

If Process 3 arrives when the CS is free, what will be the CS Status after Step 8?

A Occupied by P3

B Occupied by P2

C Free

D Waiting

💡 Hint

Look at Step 8 and Step 9 in the execution_table for Process 3's actions.

Concept Snapshot

Critical Section Problem:
- Only one process can be in the critical section (CS) at a time.
- Processes check if CS is free before entering.
- If occupied, processes wait.
- After executing CS, process exits and signals others.
- Ensures mutual exclusion and prevents race conditions.

Full Transcript

The critical section problem involves multiple processes wanting to access a shared resource exclusively. Each process checks if the critical section is free before entering. If free, it enters and executes its code inside the critical section. If occupied, the process waits until the critical section becomes free. After finishing, the process exits and signals others to enter. This ensures only one process accesses the shared resource at a time, preventing conflicts. The execution table shows processes taking turns entering and exiting the critical section, with waiting processes queued until the resource is free.