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

Database, how create database design for pharmacy by diagram and query

how create database design for pharmacy by diagram and query

Explain token ring, Explain Token Ring. Token Ring: A token ring is ...

Explain Token Ring. Token Ring: A token ring is a collection of single point -to-point links, which arise from a circle. In a token ring a special bi t pattern, termed as th

Real-time systems and control, A group report with no more than three stude...

A group report with no more than three students per group is to be handed in to explain your design procedures and simulation results. Representative graphical system outputs (clea

Calculate the complexity of sorting algorithms, How do you calculate the co...

How do you calculate the complexity of sorting algorithms? Find the complexity of Insertion sort and Bubble Sort.                 The difficulty of sorting algorithms depends o

Differentiate between synchronous and asynchronous i/o, Differentiate betwe...

Differentiate between synchronous and asynchronous input/output with the help of an example. The input-output operation is asynchronous input/output operation since after the s

4, Ask question 4#Minimum 100 words accepted#

Ask question 4#Minimum 100 words accepted#

Explain bernstein conditions for detection of parallelism, Bernstein Condit...

Bernstein Conditions for Detection of Parallelism For execution of a number of instructions or a block of instructions in parallel, it must be made certain that instructions ar

Which scheduling in cpu is allocate for least cpu-burst time, The schedulin...

The scheduling in which CPU is allocated to the process with least CPU-burst time is called? Ans. Shortest job first Scheduling wherein CPU is allocated to the process with lea

When should we stop testing, When should you stop testing? It is quite ...

When should you stop testing? It is quite complex to determine as many modern software applications are so complex and run in like an interdependent environment that complete t

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