An efficient deadlock avoidance algorithm

Raphael Finkel, Hari H. Madduri

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


The Banker's algorithm avoids deadlocks by requiring the existence of a safe sequence of job completions before granting any request. We generalize this safety test and calculate the minimum number of resources needed to assure that an allocation state is safe. We also introduce a data structure that remembers safe sequences across calls to the resource allocator. We derive an O(log n) safety test for n processes.

Original languageEnglish
Pages (from-to)25-30
Number of pages6
JournalInformation Processing Letters
Issue number1
StatePublished - Jan 15 1987


  • Banker's algorithm
  • deadlock avoidance
  • resource allocation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'An efficient deadlock avoidance algorithm'. Together they form a unique fingerprint.

Cite this