Please enable JavaScript.

Coggle requires JavaScript to display documents.

Deadlocks (Methods for Handling Deadlocks (Deadlock Prevention (Provides a…

- - - - At least one resource must be held in a none shareable mode. If another process request the resource, the process must be delayed until the resource is released.
    - - A process must be holding at least one resource and waiting to acquire additional resources that are currently held by other processes.
    - - Resources can only be released voluntarily by the process holding it after that process has completed its task.
    - - A set of waiting processes must exist such that P0 is waiting for a resource held by P1 and P1 is waiting for a resource held by P2 and P2 is waiting for a resource held by P0.
- - - - The deadlocked processes may have computed for a long time and the result of these partial computations must be discarded and probably will have to recompute later.
  - - - After each process is terminated a deadlock detection algorithm must be invoked to determine if the deadlock persists causing considerable overhead.