What is the difference among deadlock avoidance, detection
and prevention?
- 3 Answers
- 22500 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Deadlock Prevention:
Preventing deadlocks by constraining how requests for resources can be
made in the system and how they are handled (system design).
The goal is to ensure that at least one of the necessary conditions for
deadlock can never hold.
Deadlock Avoidance:
The system dynamically considers every request and decides whether it is
safe to grant it at this point,
The system requires additional apriori information regarding the overall
potential use of each resource for each process.
Allows more concurrency.
Similar to the difference between a traffic light
and a police officer directing traffic.
| Is This Answer Correct ? | 19 Yes | 6 No |
Answer / s_rock
Prevention:
• The goal is to ensure that at least one of the
necessary conditions for deadlock can never hold.
• Deadlock prevention is often impossible to
implement.
• The system doesnot require additional apriori
information regarding the overall potential use of each
resource for each process.
• In order for the system to prevent the deadlock
condition it does not need to know all the details of all
resources in existence, available and requested.
• Deadlock prevention techniques include non-blocking
synchronization algorithms, serializing tokens, Dijkstras
algorithm etc.
• Resource allocation strategy for deadlock
prevention is conservative, it under commits the resources.
• All resources are requested at once.
• In some cases preempts more than often necessary.
Avoidance:
• The goal for deadlock avoidance is to the system
must not enter an unsafe state.
• Deadlock avoidance is often impossible to
implement.
• The system requires additional apriori information
regarding the overall potential use of each resource for
each process.
• In order for the system to be able to figure out
whether the next state will be safe or unsafe, it must know
in advance at any time the number and type of all resources
in existence, available, and requested.
• Deadlock avoidance techniques include Banker’s
algorithm, Wait/Die, Wound/Wait etc.
• Resource allocation strategy for deadlock avoidance
selects midway between that of detection and prevention.
• Needs to be manipulated until atleast one safe path
is found.
• There is no preemption.
Detection:
• The goal is to detect the deadlock after it occurs
or before it occurs.
• Detecting the possibility of a deadlock before it
occurs is much more difficult and is, in fact, generally
undecidable. However, in specific environments, using
specific means of locking resources, deadlock detection may
be decidable.
• The system doesnot requires additional apriori
information regarding the overall potential use of each
resource for each process in all cases.
• In order for the system to detect the deadlock
condition it does not need to know all the details of all
resources in existence, available and requested.
• A deadlock detection technique includes, but is not
limited to, Model checking. This approach constructs a
Finite State-model on which it performs a progress analysis
and finds all possible terminal sets in the model.
• Resource allocation strategy for deadlock detection
is very liberal. Resources are granted as requested.
• Needs to be invoked periodically to test for
deadlock.
• Preemption is seen.
| Is This Answer Correct ? | 10 Yes | 2 No |
Answer / avinash raipuria
*
Deadlock Prevention:
o Preventing deadlocks by constraining how
requests for resources can be made in the system and how
they are handled (system design).
o The goal is to ensure that at least one of the
necessary conditions for deadlock can never hold.
*
Deadlock Avoidance:
o The system dynamically considers every request
and decides whether it is safe to grant it at this point,
o The system requires additional apriori
information regarding the overall potential use of each
resource for each process.
o Allows more concurrency.
Similar to the difference between a traffic light
and a police officer directing traffic.
* Deadlock deduction:-
Often, neither avoidance nor deadlock
prevention may be used. Instead deadlock detection and
process restart are used by employing an algorithm that
tracks resource allocation and process states, and rolls
back and restarts one or more of the processes in order to
remove the deadlock. Detecting a deadlock that has already
occurred is easily possible since the resources that each
process has locked and/or currently requested are known to
the resource scheduler or OS.
Detecting the possibility of a deadlock before it occurs is
much more difficult and is, in fact, generally undecidable,
because the halting problem can be rephrased as a deadlock
scenario. However, in specific environments, using specific
means of locking resources, deadlock detection may be
decidable. In the general case, it is not possible to
distinguish between algorithms that are merely waiting for a
very unlikely set of circumstances to occur and algorithms
that will never finish because of deadlock.
Deadlock detection techniques include, but is not limited
to, Model checking. This approach constructs a Finite
State-model on which it performs a progress analysis and
finds all possible terminal sets in the model. These then
each represent a deadlock.
| Is This Answer Correct ? | 8 Yes | 1 No |
Explain the process control block of UNIX ?
What is Awk and Sed?
If you tries to mount a share ( home directory )in a client machine, and it fails how do u approach?
What are the reasons for implementing process migration?
directories can be implemented either special files that can only be accused in limited ways or can be implemented as ordinary data files. what are advantages and disadvantages of this approach?
Tell me what are the hardware problem you face regularly in your organization?
Explain the difference between fat & ntfs?
how make a bootable dick
0 Answers Accenture, HCL, Wipro,
What is LOM and how do you access it?
Define dynamic memory allocation algorithm?
why register are stored the only binary data?
some os have a tree structure file system that limits the depth of a tree and small number of levels.what limit does this have on user? how does this simplify file system design?
SDK 
