From c28550252c973034151512bb5be631b611860fd9 Mon Sep 17 00:00:00 2001 From: Ankush Soni Date: Sat, 27 Oct 2018 18:46:27 +0530 Subject: [PATCH] Added a point in handling deadlock (#19997) --- guide/english/computer-science/deadlock/index.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/guide/english/computer-science/deadlock/index.md b/guide/english/computer-science/deadlock/index.md index d745cc0ec8..fcecab145f 100644 --- a/guide/english/computer-science/deadlock/index.md +++ b/guide/english/computer-science/deadlock/index.md @@ -27,6 +27,7 @@ Deadlock can arise if four conditions hold simultaneously. - **Circular wait** : there exists a set { P0, P1, …, P0 } of waiting processes such that P0 is waiting for a resource that is held by P1, P1 is waiting for a resource that is held by P2, …, Pn –1 is waiting for a resource that is held by Pn, and P0 is waiting for a resource that is held by P0. ### Methods for Handling Deadlocks +- Put the system in a situation where the deadlock can be avoided, i.e. Deadlock Avoidance. - Ensure that the system will never enter a deadlock state. - Allow the system to enter a deadlock state and then recover. - Ignore the problem and pretend that deadlocks never occur in the system; **used by most operating systems, including UNIX**. @@ -48,4 +49,4 @@ Deadlock can arise if four conditions hold simultaneously. #### More information : - [Deadlock](https://en.wikipedia.org/wiki/Deadlock) -- [Operating System | Process Management | Deadlock Introduction](https://www.geeksforgeeks.org/operating-system-process-management-deadlock-introduction/) \ No newline at end of file +- [Operating System | Process Management | Deadlock Introduction](https://www.geeksforgeeks.org/operating-system-process-management-deadlock-introduction/)