Testing Deadlock-Freedom of Computer Systems

DOI10.1145/322186.322192zbMath0431.68032OpenAlexW2038890481MaRDI QIDQ3868745

Tiko Kameda

Publication date: 1980

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322186.322192

zbMATH Keywords

resource allocationnetwork flowalgorithm complexityprocessoperating systemdeadlock algorithmdeadlock-freedom of computer systemsserially reusable resource

Mathematics Subject Classification ID

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

Related Items (5)

Deadlock avoidance with a modified banker's algorithm ⋮ The parallel complexity of deadlock detection ⋮ Packings by Complete Bipartite Graphs ⋮ The Banker's problem with precedences ⋮ Deadlock-freedom in resource contentions

This page was built for publication: Testing Deadlock-Freedom of Computer Systems