{"id":383,"date":"2024-06-28T12:53:51","date_gmt":"2024-06-28T12:53:51","guid":{"rendered":"https:\/\/study.madeeasy.in\/?p=383"},"modified":"2025-07-16T14:44:01","modified_gmt":"2025-07-16T09:14:01","slug":"what-is-deadlock-in-operating-system-os","status":"publish","type":"post","link":"https:\/\/www.madeeasy.in\/study\/cs-it\/operating-system\/what-is-deadlock-in-operating-system-os","title":{"rendered":"What is Deadlock?"},"content":{"rendered":"\r\n<p style=\"text-align: justify;\">A <strong>deadlock<\/strong> is a deadlock condition in a system where a process cannot proceed because it needs to obtain a resource held by another process but it itself is holding a resource that the other process needs.<\/p>\r\n<h2 style=\"text-align: justify;\">Resource Allocation Graph (RAG)<\/h2>\r\n<p style=\"text-align: justify;\">It is a directed graph which consists of set of vertices V and a set of edges E. V is divided into set of processes (P) and set of resources (R). E is divided into two types: requesting and allocating edge.<\/p>\r\n<p style=\"text-align: justify;\"><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-217 aligncenter\" src=\"http:\/\/study.madeeasy.in\/wp-content\/uploads\/2024\/06\/resource-allocation-graph.png\" alt=\"Resource Allocation graph\" width=\"371\" height=\"178\" \/><\/p>\r\n\r\n\r\n\r\n<p style=\"text-align: center;\"><a class=\"btn btn-danger\" role=\"button\" href=\"https:\/\/study.madeeasy.in\/cs-it\/operating-system\/what-is-cpu-scheduling-and-its-types\/\" target=\"_blank\" rel=\"noopener\">&lt;&lt; Previous<\/a> | <a class=\"btn btn-success\" role=\"button\" href=\"https:\/\/study.madeeasy.in\/cs-it\/operating-system\/what-is-logical-virtual-vs-physical-address-space\/\" target=\"_blank\" rel=\"noopener\"> Next &gt;&gt;<\/a> <br \/><strong> Must Read: <\/strong> <a href=\"https:\/\/study.madeeasy.in\/subjects\/what-is-an-operating-system-and-its-types\/\" target=\"_blank\" rel=\"noopener\"><strong>What is an operating system and its types?<\/strong><\/a><\/p>\r\n<p>&nbsp;<\/p>\r\n","protected":false},"excerpt":{"rendered":"<p>A deadlock is a deadlock condition in a system where a process cannot proceed because it needs to obtain a<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[94,3],"tags":[107,108],"class_list":["post-383","post","type-post","status-publish","format-standard","hentry","category-operating-system","category-cs-it","tag-resource-allocation-graph","tag-what-is-deadlock"],"_links":{"self":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/383","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/comments?post=383"}],"version-history":[{"count":0,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/383\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/media?parent=383"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/categories?post=383"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/tags?post=383"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}