deadlock

computing

Also known as: deadly embrace

Written by

The Information Architects of Encyclopaedia Britannica

Last updated

June 25, 2026

Quick Summary

A deadlock in computing occurs when two or more processes are unable to proceed because each is waiting for the other to release a resource. This creates a standstill where no progress can be made by any of the involved processes. It's a state of inaction resulting from the opposition of equally powerful, uncompromising factions or processes. This can lead to a situation where neither side is capable of winning or willing to yield.123

Summary created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.

3 Britannica Sources

Ask Britannica AI about this topic

Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.

computer science
Parallel and distributed computing
…concurrency control are known as deadlocks and race conditions. Deadlock occurs when a resource held indefinitely by one process is requested by two or more other processes simultaneously. As a result, none of the processes that call for the resource can continue; they are deadlocked, waiting for the resource to…
Read More
…concurrency control are known as deadlocks and race conditions. Deadlock occurs when a resource held indefinitely by one process is requested by two or more other processes simultaneously. As a result, none of the processes that call for the resource can continue; they are deadlocked, waiting for the resource to…
Read More