Deadlock avoidance with a modified banker's algorithm
There are three methods for handling deadlocks in resource allocation systems: deadlock prevention, deadlock avoidance and deadlock detection combined with recovery. Of these three methods deadlock avoidance is preferable in many cases but seldom used on account of its high cost. We present a simple modification of a known deadlock avoidance algorithm, the banker's algorithm, which has a running time \(\theta (mn^ 2)\) in a system consisting of n processes and m different types of resources. Our modified algorithm gives an amortized worst case running time of O(mn) under certain likely conditions and in that way it can be considered a competitive method for handling deadlocks. At worst, our algorithm is twice as fast as banker's algorithm.
- Deadlock prevention with collectively occupied resources
- A new algorithm for deadlock avoidance
- Time efficient deadlock resolution algorithms
- A fair Banker's Algorithm for read and write locks
- scientific article; zbMATH DE number 3864482 (Why is no real title available?)
- Design of Minimum-Cost Deadlock-Free Systems
- scientific article; zbMATH DE number 4058845 (Why is no real title available?)
- The Banker's problem with precedences
This page was built for publication: Deadlock avoidance with a modified banker's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091127)
