Deadlock avoidance revisited
From MaRDI portal
Publication:3951540
DOI10.1145/322344.322351zbMath0489.68039OpenAlexW2159939299MaRDI QIDQ3951540
Publication date: 1982
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322344.322351
NP-complete problemPSPACE- completedeadlock avoidance in operating systemsdeadlock- prediction problem for a set of processes using locksdeadlock-avoidance problem for processes with brancheswait-for relations
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Algorithms in computer science (68W99)
Related Items
The parallel complexity of deadlock detection ⋮ Concurrent execution of transaction copies ⋮ Une approche quantitative de l'exclusion mutuelle ⋮ On deadlocks of exclusive AND-requests for resources ⋮ Code aware resource management
This page was built for publication: Deadlock avoidance revisited
