As discussed in the previous post, deadlock has following characteristics.
Mutual Exclusion. Hold and Wait. No preemption. Circular wait.
We can prevent Deadlock by eliminating any of the above four condition.
Eliminate Mutual Exclusion
It is not possible to dis-satisfy the mutual exclusion because some resources, such as the tap drive and printer, are inherently non-shareable.
Eliminate Hold and wait
1. Allocate all required resources to the process before start of its execution, this way hold and wait condition is eliminated but it will lead to low device utilization. for example, if a process requires printer at a later time and we have allocated printer before the start of its execution printer will remained blocked till it has completed its execution.
2. Process will make new request for resources after releasing the current set of resources. This solution may lead to starvation.
Eliminate No Preemption
Preempt resources from process when resources required by other high priority process.
Eliminate Circular Wait
Each resource will be assigned with a numerical number. A process can request for the resources only in increasing order of numbering.
For Example, if P1 process is allocated R5 resources, now next time if P1 ask for R4, R3 lesser than R5 such request will not be granted, only request for resources more than R5 will be granted.
Deadlock avoidance can be done with Banker’s Algorithm.
Bankers’s Algorithm is resource allocation and deadlock avoidance algorithm which test all the request made by processes for resources, it check for safe state, if after granting request system remains in the safe state it allows the request and if their is no safe state it don’t allow the request made by the process.
Inputs to Banker’s Algorithm
1. Max need of resources by each process.
2. Currently allocated resources by each process.
3. Max free available resources in the system.
Request will only be granted under below condition.
1. If request made by process is less than equal to max need to that process.
2. If request made by process is less than equal to freely availbale resource in the system.
Total resources in system: A B C D 6 5 7 6
Available system resources are: A B C D 3 1 1 2
Processes (currently allocated resources): A B C D P1 1 2 2 1 P2 1 0 3 3 P3 1 2 1 0
Processes (maximum resources): A B C D P1 3 3 2 2 P2 1 2 3 4 P3 1 3 5 0
Need = maximum resources - currently allocated resources. Processes (need resources): A B C D P1 2 1 0 1 P2 0 2 0 1 P3 0 1 4 0
Following are Gate Previous Year Question
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
- Operating System | Resource Allocation Graph (RAG)
- Program for Banker's Algorithm | Set 1 (Safety Algorithm)
- Zombie Processes and their Prevention
- Last Minute Notes – Operating Systems
- What exactly Spooling is all about?
- Operating System | Banker's Algorithm
- Operating System | Paging
- Operating System | Thread
- Operating System | Memory Management |Partition Allocation Method
- Deadlock Detection And Recovery
- Operating System | Process Management | Deadlock Introduction
- Operating System | Process Synchronization | Introduction
- Operating System | Process Management | Introduction
- Operating Systems | Set 16
- Mutex vs Semaphore