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

Design issues, Design issues:  To complete the maximum processor utilizatio...

Design issues:  To complete the maximum processor utilization in a multithreaded architecture, the following design issues have to be addressed: Context Switching time: S

Big – endian and little- endian representations, Explain Big - Endian and L...

Explain Big - Endian and Little- Endian representations Ans: The Big- endian is used where lower byte addresses are used for the more significant bytes (leftmost bytes) of the

What is inode, What is 'inode'? All UNIX files have its description kep...

What is 'inode'? All UNIX files have its description kept in a structure called 'inode'. The inode have info about the file-size, its location, time of last access, time of las

Reduce minimum literals and derive their complements, Q. Reduce following t...

Q. Reduce following to minimum literals and derive their complements. 1. [(AB)'A][(AB)'B] 2. ABC(ABC' + AB'C + A'BC) 3. (A+C+D) (A+C+D') (A+C'+D)(A+D')

Operating system., what is the minimum number of page faults for an optimal...

what is the minimum number of page faults for an optimal page replacement strategy?

Describe the various characteristics of udp protocol, Describe the various ...

Describe the various characteristics of UDP protocol. The characteristics of the UDP are as follows: End to end: UDP is transport protocols that can distinguish between

Observations of high level language program, Q. Observations of High Level ...

Q. Observations of High Level Language Program? Observations Integer constants appeared nearly as frequently as structures or arrays. Most of the scalars were foun

Pre-os and runtime sub-os functionality, In a raw Itanium, a 'Processor Abs...

In a raw Itanium, a 'Processor Abstraction Layer' (PAL) is incorporated in system. When it's booted PAL is loaded in the CPU and provides a low-level interface which abstracts a nu

What is algorithm design technique, What is Algorithm Design Technique? ...

What is Algorithm Design Technique? An  algorithm  design  method  is  a  general  approach  to  solving  problems  algorithmically  that  is applicable to a variety of proble

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