Title

An Extended Banker'S Algorithm For Deadlock Avoidance

Keywords

Banker's algorithm; Deadlock; Deadlock avoidance; Graph reduction; Operating system; Worst-case complexity

Abstract

We describe a natural extension of the banker's algorithm for deadlock avoidance in operating systems. Representing the control flow of each process as a rooted tree of nodes corresponding to resource requests and releases, we propose a quadratic-time algorithm which decomposes each flow graph into a nested family of regions, such that all allocated resources are released before the control leaves a region. Also, information on the maximum resource claims for each of the regions can be extracted prior to process execution. By inserting operating system calls when entering a new region for each process at runtime, and applying the original banker's algorithm for deadlock avoidance, this method has the potential to achieve better resource utilization because information on the localized approximate maximum claims is used for testing system safety. ©1999 IEEE.

Publication Date

12-1-1999

Publication Title

IEEE Transactions on Software Engineering

Volume

25

Issue

3

Number of Pages

428-432

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/32.798330

Socpus ID

0032594210 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0032594210

This document is currently not available here.

Share

COinS