The parallel complexity of deadlock detection

DOI10.1016/0304-3975(87)90084-3zbMath0623.68028OpenAlexW2090230269MaRDI QIDQ1091805

Paul G. Spirakis

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90084-3

zbMATH Keywords

parallel algorithmsdeadlock detectionexclusive controlmulti-unit resurces

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum flow problem is log space complete for P
• Complete problems for deterministic polynomial time
• Linear programming is log-space hard for P
• Testing Deadlock-Freedom of Computer Systems
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• Deadlock avoidance revisited
• Deadlock Prediction: Easy and Difficult Cases
• Locking and Deadlock Detection in Distributed Data Bases
• Game interpretation of the deadlock avoidance problem
• Prevention of system deadlocks
• Comments on prevention of system deadlocks

This page was built for publication: The parallel complexity of deadlock detection