Abstract
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 language | English |
---|---|
Pages (from-to) | 25-30 |
Number of pages | 6 |
Journal | Information Processing Letters |
Volume | 24 |
Issue number | 1 |
DOIs | |
State | Published - Jan 15 1987 |
Keywords
- Banker's algorithm
- deadlock avoidance
- resource allocation
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications