1. What is a Deadlock?
Imagine two cars meeting on a very narrow bridge. Neither car can move forward because the other is blocking its path. Neither car will back up. They are stuck forever.
In computer engineering, this is a Deadlock. It happens when two
different programs are waiting for each other to finish, but because nobody moves, the whole computer freezes.
2. The "Four Rules" of a Deadlock
For a computer to get stuck like this, four things must happen at the same time (Engineers call these the Coffman Conditions):
Mutual Exclusion: Only one program can use a resource (like a printer) at a time.
Hold and Wait: A program holds one tool while waiting for another.
No Preemption: You can't force a program to give up its tool; it has to finish first.
Circular Wait: Program A waits for B, B waits for C, and C waits for A. It’s a perfect, broken circle.
3. How Engineers Fix It
When we write technical documentation for systems, we use three main strategies:
Prevention: Change the rules so a "circle" can never happen.
Avoidance: The computer "looks ahead" and refuses to start a task if it looks like a trap.
Detection & Recovery: Let the deadlock happen, find it, and "kill" one of the programs to break the cycle (this is what happens when you use Task Manager to force-close an app).
For further actions, you may consider blocking this person and/or reporting abuse
Top comments (0)