Time efficient deadlock resolution algorithms

DOI10.1016/S0020-0190(98)00203-8zbMath0917.68084OpenAlexW2058878393WikidataQ127179032 ScholiaQ127179032MaRDI QIDQ1285615

K. Appert

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

distributed systemsresource allocationoperating systemsdeadlock resolutionminimum abort setreusable resources

Mathematics Subject Classification ID

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

Related Items (2)

Deadlock resolution in wait-for graphs by vertex/arc deletion ⋮ On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem

Cites Work

• Unnamed Item
• Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs
• On Minimum Cost Recovery from System Deadlock

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