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

Describes responsibilities of the I/O manager, Q. Describes responsibilitie...

Q. Describes responsibilities of the I/O manager? Answer: The I/O manager is responsible for file systems and device drivers and network drivers. The I/O manager keeps follow

Demand-paging system, Consider a demand-paging system with the following ti...

Consider a demand-paging system with the following time-measured utilizations: CPU utilization: 10%, Paging disk: 98%, Other I/O devices: 5%. What does this imply? How to improv

What are the various layers of a file system, What are the various layers o...

What are the various layers of a file system? The file system is composed of many dissimilar levels. Each level in the design uses the feature of the lower levels to make new f

What is long-term, What is long-term, medium-term, short-term? In a bat...

What is long-term, medium-term, short-term? In a batch system many processes are submitted than are able to be executed immediately. These processes are reel to a mass storage

What is a relocatable program, What is a Relocatable program? The Reloc...

What is a Relocatable program? The Relocatable programs can be loaded almost anywhere in memory.

Beladys anomaly algorithm, Q.  You have devised a fresh page-replacement a...

Q.  You have devised a fresh page-replacement algorithm that you think may be optimal. In a few contorted test cases Belady's anomaly occurs. Is the fresh algorithm optimal? Descr

Operating systems structures, with the aid of diagrams describe the followi...

with the aid of diagrams describe the following OS structure monolithic,layered and client server.

What is page fault and how to remove page fault?, What is page fault and wh...

What is page fault and what are the steps taken by the OS to remove page fault? A page fault is caused while a page that hasn't been brought into memory is being addressed. The

Explain long term scheduling, Long term scheduling Scheduling explicitl...

Long term scheduling Scheduling explicitly performed when a new process is created and it determines which programs are admitted to the system for processing. Therefore it cont

Find the number of drives in the jukebox, Q. In a disk jukebox what would b...

Q. In a disk jukebox what would be the result of having more open files than the number of drives in the jukebox? Answer: Two bad results could result. One likelihood is star

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