Explain about deadlock prevention, Operating System

Assignment Help:

Explain about deadlock prevention?

In order for the occurrence of deadlock, the four conditions like mutual exclusion, hold and wait, no pre-emption and  circular wait must happen. By ensuring that one of these conditions cannot hold, we can stop the occurrence of deadlock.

Mutual exclusion

It must hold for non-sharable resources. For example a printer cannot be simultaneously shared by several processes. Sharable resources do not need mutually exclusive access, and therefore cannot be include in deadlock. Read-only files are a good example of a sharable resource.

Hold and wait

To ensure that hold and wait condition never happens in the system, we must guarantee that, whenever a process requests a resource, it does not hold any other resources. The protocols used are

1. Every process is to be request and be allocated all its resources before it begins execution.

2. Permits a process to request some resources only when the process has none (no other resources).

 


Related Discussions:- Explain about deadlock prevention

Aggregate planning, Prepare a report that motivates alternatives reactive s...

Prepare a report that motivates alternatives reactive strategies that can be used by wind Mud clothing factory

Explain about disk scheduling with neat diagram, Explain about disk schedul...

Explain about disk scheduling with neat diagram? FCFS Scheduling SCAN scheduling C-SCAN scheduling SSTF scheduling LOOK Scheduling

BC0056, Write a C program that illustrates the creation of child process us...

Write a C program that illustrates the creation of child process using fork system call. One process finds sum of even series and other process finds sum of odd series.

Homework, Write an application that does the following:(1) fill an array wi...

Write an application that does the following:(1) fill an array with 50 random integers; (2) loop through the array, displaying each value, and count the number of negative values;

Buffer, Ask question #Minimum 100 words accepted application of bounded and...

Ask question #Minimum 100 words accepted application of bounded and unbounded buffers

Write a brief note on demand paging, Write a brief note on demand paging. ...

Write a brief note on demand paging. A demand paging is alike to a paging system with swapping. The Processes reside on the secondary memory while we want to implement a proces

Differences between foreground and background, Describe the differences bet...

Describe the differences between foreground and background processing. What advantage does background processing provide? 1. Background processes typically run with little or no

Unix, UNIX Shell and History feature. 1.Creating a child process. 2.Creatin...

UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. With the notes under code. Its exactly "programming project 1 - Unix Shell and History Fea

What is a process, What is a process? A process is a program in impleme...

What is a process? A process is a program in implementation. It is an active entity and it contains the process stack, having temporary data and the data section includes globa

What is busy waiting, What is busy waiting? The repeated implementation...

What is busy waiting? The repeated implementation of a loop of code while waiting for an event to happen is known as busy-waiting. The CPU is not engaged in any actual producti

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd