Time efficient deadlock resolution algorithms

DOI10.1016/S0020-0190(98)00203-8MaRDI QIDQ1285615zbMATH OpenOpenAlexWikidataFDO

Authors K. Appert, Igor Terekhov, Tracy Camp

Publication date 28 April 1999

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(98)00203-8

zbMATH Keywords

deadlock resolutiondistributed systemsminimum abort setoperating systemsresource allocationreusable resources

Mathematics Subject Classification ID

Distributed systems (68M14) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 3976331
• Design of Minimum-Cost Deadlock-Free Systems
• Publication:4727428
• Deadlock avoidance with a modified banker's algorithm
• Deadlock resolution in wait-for graphs by vertex/arc deletion

Cites work

• scientific article; zbMATH DE number 3359777 (Why is no real title available?)
• On Minimum Cost Recovery from System Deadlock
• Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs

Cited in

(13)

• Deadlock avoidance with a modified banker's algorithm
• Resolution of process collisions in the scalable computer systems
• Fast decentralized algorithms for resolving conflicts and deadlocks in resource allocation in data processing and control systems
• On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem
• Deadlock resolution in wait-for graphs by vertex/arc deletion
• scientific article; zbMATH DE number 3976331 (Why is no real title available?)
• Design of Minimum-Cost Deadlock-Free Systems
• scientific article; zbMATH DE number 139938 (Why is no real title available?)
• An Automatic Approach to Deadlock Detection and Resolution in Discrete Simulation Systems
• scientific article; zbMATH DE number 4001481 (Why is no real title available?)
• Stochastic analysis of distributed deadlock scheduling
• Automata, Languages and Programming
• A parallel multi-unit resource deadlock detection algorithm with \(O(\log _2(\min (m, n)))\) overall run-time complexity

This page was built for publication: Time efficient deadlock resolution algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285615)