{"id":2987,"date":"2021-07-06T16:08:53","date_gmt":"2021-07-06T10:38:53","guid":{"rendered":"https:\/\/www.goseeko.com\/blog\/?p=2987"},"modified":"2026-04-14T05:51:46","modified_gmt":"2026-04-14T00:21:46","slug":"what-is-deadlock","status":"publish","type":"post","link":"https:\/\/www.goseeko.com\/blog\/what-is-deadlock\/","title":{"rendered":"What is Deadlock?"},"content":{"rendered":"\n

A deadlock happens when a set of processes becomes stuck because each one is holding a resource and waiting for another to get it.<\/p>\n\n\n\n

Consider the situation when two trains are approaching each other on the same track and there is only one track: once they are in front of each other, neither train can move. In operating systems, a similar situation happens when two or more processes hold some resources while waiting on resources owned by other processes (s). In the picture below, Process 1 is holding Resource 1 and waiting for Process 2 to acquire Resource 2, while Process 2 is waiting for Resource 1.<\/p>\n\n\n\n

Deadlocks required certain conditions<\/strong><\/h2>\n\n\n\n
    \n
  1. Mutual exclusion<\/strong> : Only mutually exclusive sharing of a resource is possible. If two processes can’t use the same resource at the same time, this is what it means.<\/li>\n<\/ol>\n\n\n\n
      \n
    1. Hold and wait<\/strong> : A procedure waits for some resources while simultaneously holding another resource.<\/li>\n<\/ol>\n\n\n\n
        \n
      1. No preemption <\/strong>: The process, once scheduled, will be carried out until it is completed. In the meanwhile, the scheduler is unable to schedule any further processes.<\/li>\n<\/ol>\n\n\n\n
          \n
        1. Circular\u00a0 wait<\/strong> : All processes must wait for resources in a cyclic fashion, so that the final process is waiting for the resource that the first process is holding.<\/li>\n<\/ol>\n\n\n\n
          \n