A state in a concurrent system in which two or more processes are each waiting for a resource held by another of them, so that none can proceed; a central hazard concurrent and distributed systems must be designed to prevent, detect or recover from.
Facts
Core PrincipleDeadlock is any situation in which no member of some group of processes can proceed because each waits for another member to release a resource it holds, so that none of them can ever make progress. 1 Connections
Sources
1. Wikipedia: Deadlock (Computer Science)
Wikimedia FoundationLead paragraph, deadlock definition
deadlock is any situation in which no member of some group of entities can proceed because each waits for another member
Necessary conditions section, Coffman conditions
These four conditions are known as the Coffman conditions from their first description in a 1971 article by Edward G. Coffman, Jr.
View the Source Free On-line Dictionary of Computing: Deadlock
Free On-line Dictionary of ComputingIn Group: Concurrency and Distributed Computing Problems, Dictionary entryQuote, In Group: Concurrency and Distributed Computing Problems, Dictionary entry
A situation where two or more processes are unable to proceed because each is waiting for one of the others to do something
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.