Operating systems deadlocks notes

What is a deadlock?

A deadlock is a situation in a multi-tasking environment where two or more processes are unable to proceed because each is waiting for the other to release a resource.

List the necessary conditions for a deadlock.

- Mutual Exclusion - Hold and Wait - No Preemption - Circular Wait

True or False: Deadlocks can occur in single-threaded systems.

False. Deadlocks require multiple processes or threads competing for resources.

Cause → Effect of deadlocks.

Cause: Processes hold resources and request more. Effect: System freeze, requiring external intervention.

Define mutual exclusion in the context of deadlocks.

Mutual exclusion occurs when at least one resource must be held in a non-shareable mode. Only one process can use the resource at a time.

Example of a deadlock scenario.

Process A holds Resource 1 and waits for Resource 2. Process B holds Resource 2 and waits for Resource 1. Both processes are blocked.

Hold and Wait: What does this mean?

Processes holding resources may request additional resources without releasing their current ones, leading to potential deadlocks.

What is circular wait?

Circular wait is a condition in which a set of processes are waiting for each other in a circular chain, forming a loop that prevents any process from proceeding.

Define no preemption.

No preemption means that once a resource has been allocated to a process, it cannot be forcibly taken from that process until it voluntarily releases it.

How can deadlocks be detected?

Through resource allocation graphs or wait-for graphs where cycles indicate the presence of a deadlock situation.

Fill in the blank: Deadlocks can result in _____ of processes in the system.

a complete halt

What is the significance of resource allocation graphs?

They visually represent the allocation and request relationships between processes and resources, helping to identify potential deadlocks.

Contrast deadlock and starvation.

Deadlock: processes are permanently blocked. Starvation: processes are delayed indefinitely but may eventually proceed.

What is a wait-for graph?

A wait-for graph is a directed graph that shows which processes are waiting for resources held by other processes, used to detect deadlocks.

True or False: Deadlocks can be resolved by simply restarting the system.

True. While this resolves the deadlock, it is not an efficient or practical solution in many cases.

What happens during a deadlock?

Processes are stuck in a state of waiting, consuming memory and resources, which could otherwise be utilized by other processes.

Deadlock Prevention

Strategies that ensure deadlocks never occur by preventing one of the necessary conditions.

What are the four conditions for deadlocks?

1. Mutual Exclusion 2. Hold and Wait 3. No Preemption 4. Circular Wait

True or False: Deadlock prevention is always possible.

True: By ensuring at least one deadlock condition does not hold.

Hold and Wait

A condition where processes hold allocated resources while waiting for additional ones. Can be prevented by requiring all resources upfront.

What is resource allocation graph?

A directed graph used to represent the allocation of resources to processes and helps in detecting possible deadlocks.

Deadlock Avoidance

Methods that ensure a system never enters an unsafe state by careful resource allocation.

Banker's Algorithm

A deadlock avoidance algorithm that checks resource allocation safety before granting requests.

Fill in the blank: The Banker's Algorithm uses the concept of ______.

Safe and unsafe states.

Comparison: Deadlock Prevention vs. Deadlock Avoidance

Prevention stops deadlocks entirely. Avoidance allows temporary states but checks for safety.

What is a safe state?

A state where the system can allocate resources to processes without leading to a deadlock.

True or False: In deadlock avoidance, processes can always obtain resources.

False: Resources may be denied to avoid entering an unsafe state.

Circular Wait

A condition where processes form a cycle, each waiting for a resource held by the next. Prevented by ordering resources.

Resource Allocation Order

Establishes a sequence for resource requests to prevent circular wait conditions.

What is preemption?

Forcing a process to release resources, which can break deadlock conditions but may lead to resource starvation.

Example of a deadlock avoidance scenario.

Consider processes A and B. A requests resource X, and B requests resource Y. They cannot proceed unless one releases a resource.

Maximal Resource Claim

Each process must declare the maximum resources it may need at the start, aiding in deadlock avoidance strategy.