A new algorithm for deadlock avoidance
This paper presents an algorithm for deadlock avoidance in a resource sharing environment with multiple types of resources, where the maximum claims of the individual processes are unknown a priori. A new copy of process ordering is introduced in place of resource ordering. We also present a preallocation algorithm for predicting the requests that could be granted. This predictor process runs on the fly with the underlying computation of the system. The resource manager runs a preallocation algorithm when it is idle (does not receive messages from the processes) or when the processes request for resources but the possibility of allocations has not been evaluated. The deadlock avoidance and the preallocation algorithms are suitable for both centralized and distributed systems.
- Deadlock avoidance with a modified banker's algorithm
- A fair Banker's Algorithm for read and write locks
- scientific article; zbMATH DE number 3864482 (Why is no real title available?)
- Deadlock Prevention in Process Control Computer Systems
- scientific article; zbMATH DE number 4056989 (Why is no real title available?)
- Extension of the Banker's algorithm for resource allocation in a distributed operating system
This page was built for publication: A new algorithm for deadlock avoidance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111010)
