What are the necessary conditions for deadlocks?, Operating System

Assignment Help:

What are the necessary conditions for deadlocks?

1.Mutual exclusion:  Only one process at a time is able to use the resource.

2.Hold and wait:  A process should be holding at least one resource and waiting   to acquire additional resources that are currently being held by other processes.

3.No preemption:  Resource cannot be preempted that is, a resource is able to be released only voluntarily by the process holding it, subsequent to that process has completed its task.

4.Circular wait:A set {p0,p1,.........,pn} of waiting processes should exit such that p0 is waiting for a resource that is held by p1 and p1 is waiting for a resource that is held by p2,.........,pn-1 is waiting for a resource that is held by pn, and pn is waiting for a resource that is held by p0.

 


Related Discussions:- What are the necessary conditions for deadlocks?

Define thread cancellation and target thread, Define thread cancellation & ...

Define thread cancellation & target thread. The thread cancellation is the task of terminating a thread before it has completed. A thread that is to be cancelled is often refer

Command interpreters, Develop a user mode command interpreter which support...

Develop a user mode command interpreter which support these functions: "list-short" -- just like ls without any options "list-long" -- same as ls -l "change" -- same as cd Your co

What is the use of FIFOs in client-server applications, What is the use of ...

What is the use of FIFOs in client-server applications

Multiprogramming, explain how response time are reduced by allowing time sh...

explain how response time are reduced by allowing time sharing on top of multiprogramming

Explain lru approximation page replacement, LRU approximation page replacem...

LRU approximation page replacement In this we are able to use the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for

Lru implementation details, Now, let us discuss two related algorithms for ...

Now, let us discuss two related algorithms for deciding which pages to evict. The clock algorithm is one of the most popular choices. It works by keeping frames in a circular struc

What is time-stamping, time-stamping It is a method proposed by Lampor...

time-stamping It is a method proposed by Lamport, used to sequencing events in a distributed machine without the use of clocks. This process is intended to order events consis

Buffer, What is bounded buffer

What is bounded buffer

What are the advantages of using unequal- size partitions, In fixed portion...

In fixed portioning scheme, what are the advantages of using unequal- size partitions? With unequal-size partitions there are two probable ways to assign process to partitions.

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