Issues in deadlock n resolution

·         Required an examination of the status of process-resources interaction for the presence of cyclical wait.
·         Two conditions exist in the DS:
1.      Once a cycle is formed in the WFG, it persist until its is detected and broken, and
2.      Cycle detection can proceed concurrently with the normal activities of a system.
3.      We’ll study the techniques to detect deadlock in a DS instead of trying to prevent or avoid it.
·         Deadlock detection and resolution entails addressing two basic issues:
1.      First, detection of existing  deadlocks and
2.      Second resolution of detected deadlocks.
·         The detection of deadlocks involves two issues:
1.      Maintenance of the WFG and
2.      Search of the WFG for the presence of cycles.
·         In distributed systems, a cycle may involve several sites , so the search for cycles greatly depends upon the WFG of the system is represented across the system.
·         Depending upon the manner in which WFG information is maintained and the search for cycles is carried out, there are centralized, distributed, and hierarchical algorithms for deadlock detection in distributed systems.
·         Deadlock resolution involves braking existing wait-for dependencies in the system WFG to resolve the deadlock.
·         It involves rolling back one or more processes that are deadlocked and assigning their resources to blocked processes in the deadlock so that they can resume execution.
DISTRIBUTED SYSTEM covered following topics in these notes.

Post a Comment

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.