Static Deadlock Prevention

ByWalter Wimberly

Two conditions must hold for a deadlock to occur with reusable resources:

  1. Hold and wait: A process is already holding one resource and is requesting another resource.
  2. Circular wait: A process must issue a resource request that closes a cycle involving at least two processes and two resources.

Deadlock is structurally impossible if either of the two conditions are eliminated.

Eliminating Hold and Wait

Several alternatives to eliminating the hold-and-wait condition exist:

  1. Every process must request all resources ever needed at the same time. While simple, this leads to poor resource utilization since resources are held for unnecessarily long periods of time and thus unavailable to other processes.
  2. Every process must release all currently held resources prior to making any new request. Improves utilization but results in repeated requests and releases of frequently used resources.
  3. A process can be given the ability to test whether a needed resource is currently available. The process must release all currently held resources only if the requested resource is not currently available. Otherwise the new resource may be requested and allocated immediately.

Static Deadlock Prevention was originally found on Access 2 Learn

Assistant Professor

Walter Wimberly is an Assistant Professor at a regional college in Tennessee, teaching Computer Science in the Software Engineering track. He works as a student advisor, oversees curriculum changes, develops new courses, and manages the advisory panel.
Walter taught full time for about 7 years, before going back into “industry” as a full stack Software Developer for a dozen years. There he focused on web based projects coding in JavaScript/jQuery and utilizing the Bootstrap CSS Framework on the front-end, and coding in PHP, ASP/ASP.Net, SQL on the back-end.

Since he loves teaching, he taught as an adjunct web and digital media classes for eight (8) years, while working in industry, and has since returned to teaching full time.

He has been married for over 25 years, and is father to several special needs boys. As such, he is working on some projects to help others who have special needs to be self-sufficient, and support the care givers of those with special needs. Check out his Autism blog for more info.

Similar Posts

  • Processes

    ByWalter Wimberly

    A process is an instance of a program being executed by an OS. The OS manages the processes in something called a Process Control Block (PCB). This helps it keep track of what is running, how much memory is being used and where, the program being run, the current instruction address, etc. Your operating system as a…

  • Semaphores

    ByWalter Wimberly

    The software solution presented before only works if there is two processes competing for the same code block. Likewise, it is not real efficient if it needs to be used a lot. Semaphores are general-purpose primitives that allow solving a variety of synchronization problems in a systematic manner. A semaphore is a non-negative integer variable that…

  • The Hardware-Software Interface

    ByWalter Wimberly

    General purpose computers need to be able to access a variety of IO devices, from long term storage, mouse, keyboard, networking, and more. A device controller/adapter is an electronic circuit capable of operating a specific I/O device. The interface may be set by and/or examined by device drivers. A device driver is a device-specific program that implements I/O…

  • Deadlock Detection

    ByWalter Wimberly

    A deadlock in a resource allocation graph can be detected by executing a graph reduction algorithm by repeating this process: Select an unblocked process p. Remove p, including all request and allocation edges connected to p. Anything left is blocked, and risks deadlock. However, it is considered completely reducible if there are no processes left…