Interested to Buy Any Domain ? << Click Here >> for more details...
What is the difference among deadlock avoidance, detection
and prevention?
- 3 Answers
- 24267 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Let us suppose one application needs 2GB RAM to run and dependent plugins will be load while running application. Here My doubt is how many processes will create for this application. I know the concept of virtual memory, which will provide RAM on demand. My straight forward question is what is the size of the process and is it single process will create by operating system to complete the task of my application.??? Thanks in Advance.
Define dynamic memory allocation algorithm?
Explain the process control block of UNIX ?
Can you tell which dlls are used for SDK?
how make a bootable dick
Explain the difference between ntfs & fat file systems?
Explain the reasons for implementing process migration?
Explain the ways to infect the system by virus?
what is a property sheet?
What are the reasons for implementing process migration?
Explain about operating system of mac?
If you do not have cd drive then how will u format c drive?
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?
Explain about dynamic memory allocation algorithm?
absolute path gives the location a file or directory in reference to a rile directory while relative path is a path given file starting from another file. explain?
