On deadlocks of exclusive AND-requests for resources
From MaRDI portal
Publication:5137008
Recommendations
- Deadlock prevention with collectively occupied resources
- Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
- Deadlocks and dihomotopy in mutual exclusion models
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
- Resource-Oriented Deadlock Analysis
- Deadlock-freedom in resource contentions
- Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
Cites work
- scientific article; zbMATH DE number 3986679 (Why is no real title available?)
- scientific article; zbMATH DE number 194642 (Why is no real title available?)
- scientific article; zbMATH DE number 789390 (Why is no real title available?)
- A Priority Based Distributed Deadlock Detection Algorithm
- Deadlock avoidance revisited
- Deadlock-Free Packet Switching Networks
- Distributed deadlock detection
- Hierarchical deadlock detection for nested transactions
- Local Distributed Deadlock Detection by Cycle Detection and Clusterng
- The notions of consistency and predicate locks in a database system
- Time, clocks, and the ordering of events in a distributed system
Cited in
(4)
This page was built for publication: On deadlocks of exclusive AND-requests for resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137008)