Progress and No Deadlock
You'll learn why processes waiting to enter their critical sections must eventually succeed, and why idle critical sections should never block waiting processes.
When designing solutions to the critical section problem, mutual exclusion alone isn't enough—we also need progress and no deadlock.
Progress: No Unnecessary Blocking
Progress means that if no process is currently executing in its critical section, and some processes want to enter, only those processes actively trying to enter can participate in deciding who goes next. A process that has finished its critical section or is doing unrelated work elsewhere must not prevent others from entering.
Analogy: Imagine a bathroom with a lock. If the bathroom is empty and someone wants to use it, they should be able to enter immediately. It would be absurd if person A, who already left and is now eating lunch, could somehow block person B from using the empty bathroom.
No Deadlock: Someone Must Make Progress
No deadlock ensures that if multiple processes are trying to enter their critical sections simultaneously, at least one will eventually succeed. The system cannot reach a state where everyone is stuck waiting forever with no one making progress.
Analogy: Two people approaching a doorway shouldn't both freeze indefinitely, each waiting for the other to go first. A proper solution ensures at least one person gets through in finite time.
Together, progress and no deadlock guarantee liveness—the system keeps moving forward. Without these properties, processes might wait forever even when the critical section is available or when someone could proceed.
Key Takeaway: Progress ensures processes outside critical sections don't block others; no deadlock guarantees that contending processes will eventually make progress rather than waiting forever.