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

Explain bitwise-exclusive-or operator, Bitwise-Exclusive-OR Operator: ^ ...

Bitwise-Exclusive-OR Operator: ^ exclusive-OR-expression : AND-expression exclusive-OR-expression ^ AND-expression The  bitwise-exclusive-OR  operator  (^)  compares

Difference between finite automata and turing machine, What are the differe...

What are the difference between finite automata and Turing Machines?  Turing machine can alter symbols on its tape, while the FA cannot change symbols on tape.  Also  TM  has  a

Leading zeroes of a number field, In order to suppress the leading zeroes o...

In order to suppress the leading zeroes of a number field the which keywords is used ? NO-ZERO.

Illustrate about direct addressing mode, Q. Illustrate about Direct Address...

Q. Illustrate about Direct Addressing mode? In this technique operand field of instruction specifies direct address of intended operand for example if instruction LOAD 500 uses

Basic performance equation, Explain the basic performance equation Ans...

Explain the basic performance equation Ans: The basic performance equation is following T = N * S/ R T =>  It is processor time required to execute a program N => act

What is the use of urgent pointer in tcp segment, What is the use of urgent...

What is the use of urgent pointer in TCP segment? For accommodation out of band signaling, TCP permits the sender to identify data as urgent, implies that the receiving program

What is a packet switching, End systems are connected together by communica...

End systems are connected together by communication links. There are various types of communication links, which are made of numerous types of physical media, comprising twisted pa

Explain complete binary tree, Complete Binary tree A complete binary tr...

Complete Binary tree A complete binary tree can be described as a binary tree whose non leaf nodes have nonempty left and right sub tree and all leaves are at the similar level

What is elapsed time of computer system, What is elapsed time of computer s...

What is elapsed time of computer system? The total time to implement the total program is known as elapsed time. It is affected by the speed of the processor, the disk and the

Exponential search, Exponential Search Another alternative to variable ...

Exponential Search Another alternative to variable size decrease-and-conquer search is known as exponential search. This algorithm begins searching at the beginning of the list

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