Explain the necessary conditions for deadlock to occur, Computer Engineering

Assignment Help:

Explain the necessary conditions for deadlock to occur.

Conditions for deadlock to arise are:

i. Mutual exclusion: At least one resource must be held in a non-sharable mode; which is, only one process at a time can employ the resource. If other process requests which resource, the requesting process should be delayed till the resource has been released.

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

iii. No pre-emption: Resources cannot be pre-empted; which is, a resource can be released only voluntarily by the process holding this, after the process holding this has completed its task.

iv. Circular wait: A set{P0, P1,......, Pn) of waiting processes should exist therefore P0 is waiting for a resource which is held through P1, P1 is waiting for a resource which is held through P2, ......., Pn-1 is waiting for a resource which is held by Pn and Pn is waiting for a resource which is held by P0.

All four conditions should hold simultaneously for a deadlock to happen and conditions are not completely independent. For illustration, the circular-wait means the hold-and- wait condition.


Related Discussions:- Explain the necessary conditions for deadlock to occur

Turning machine, procedure of turning machine operation on markov algorithm...

procedure of turning machine operation on markov algorithm

What is priority interrupt, What is Priority interrupt. It is a system ...

What is Priority interrupt. It is a system that establishes a priority over the several resources to determined which condition are to be serviced first when two or more reques

What do you meant by dreamweaver, A Web site is a set of linked documents w...

A Web site is a set of linked documents with shared attributes, like related topics, a similar design or a shared purpose. Macromedia Dreamweaver is a site creation and management

Accessing the internet, Before we can use Internet, we have to gain access ...

Before we can use Internet, we have to gain access to it. This access is achieved in one of numerous ways. Above all, the Internet is a collection of networks which are connected t

Registers - processor, These will be independent of each other and will not...

These will be independent of each other and will not affect to each other, and so they can be fed into two different implementations units and run in parallel. The ability to remov

Example of bitwise-and operator, Example of Bitwise-AND Operator In the...

Example of Bitwise-AND Operator In the following example, the bitwise-AND operator (&) compares the bits of two integers, nNumA and nNumB: // Example of the bitwise-AND oper

Final implementation of object oriented modelling, Final Implementation of ...

Final Implementation of Object oriented modelling Final Implementation: At this phase, the final execution of classes and  relationships developed while object design takes

Procedure level- levels of parallel processing, Procedure Level Here, p...

Procedure Level Here, parallelism is accessible in the form of parallel executable procedures. In this situation, the design of the algorithm plays a main role. For example eac

Cache memories - computer architecture, Cache Memories - computer architect...

Cache Memories - computer architecture: Speed of the primary memory is very low in comparison with the speed of processor For well performance, the processor can't spend

How many octets does smallest possible ipv6 datagram contain, How many Octe...

How many Octets does the smallest possible IPV6 datagram contain? The maximum size of an Ipv6 datagram is 65575 bytes, with the 0 bytes Ipv6 header. Ipv6 also describe a minim

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