Testing Deadlock-Freedom of Computer Systems

DOI10.1145/322186.322192MaRDI QIDQ3868745zbMATH OpenOpenAlexFDO

Authors 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

algorithm complexitydeadlock algorithmdeadlock-freedom of computer systemsnetwork flowoperating systemprocessresource allocationserially reusable resource

Mathematics Subject Classification ID

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

Cited in

(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

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