Deadlocks

• In a multiprogramming environment, several processes may compete for a finite number of resources.
• A process requests resources; and if the resources are not available at that time, the process enters a waiting state. Sometimes, a waiting process is never again able to change state, because the resources it has requested are held by other waiting processes.
• Deadlock is defined as the permanent blocking of a set of processes that compete for system resources.