On deadlocks of exclusive AND-requests for resources

DOI10.1007/S004460050011zbMATH Open1448.68168OpenAlexW2024993752MaRDI QIDQ5137008FDOQ5137008

Authors: Y. C. Tay, W. Tim Loke 

Publication date: 30 November 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004460050011

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

zbMATH Keywords

resourcesdeadlocksAND-request

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The notions of consistency and predicate locks in a database system
• Time, clocks, and the ordering of events in a distributed system
• Title not available (Why is that?)
• Deadlock-Free Packet Switching Networks
• Distributed deadlock detection
• Local Distributed Deadlock Detection by Cycle Detection and Clusterng
• Hierarchical deadlock detection for nested transactions
• Deadlock avoidance revisited
• A Priority Based Distributed Deadlock Detection Algorithm

Cited In (4)

• Distributed deadlock detection
• Title not available (Why is that?)
• Description and treatment of deadlocks in the Hecodes distributed expert system
• Deadlock Detection in the Face of Transaction and Data Dependencies

Uses Software

• CalcCheck

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)