Abstract
The Banker's algorithm for resource allocation prevents deadlocks. Its straightforward extension to a distributed environment would require a centralized allocator that needs to know the state of all processes on all processors. An algorithm for resource allocation in a distributed environment without the high cost of centralized decisions is presented. This scheme imposes a hierarchy on the computers and applies a modified version of the Banker's algorithm at each level of the hierarchy.
| Original language | English |
|---|---|
| Pages (from-to) | 1-8 |
| Number of pages | 8 |
| Journal | Information Processing Letters |
| Volume | 19 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jul 26 1984 |
Keywords
- Banker's algorithm
- deadlock avoidance
- distributed systems
- resource allocation
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications