Design of Minimum-Cost Deadlock-Free Systems

DOI10.1145/2157.322403zbMATH Open0627.68029OpenAlexW2057738117MaRDI QIDQ3763583FDOQ3763583

Authors: Toshihide Ibaraki, Tiko Kameda, Hussein Abdel-Wahab 

Publication date: 1983

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

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

Recommendations

• Deadlock-freedom in resource contentions
• Time efficient deadlock resolution algorithms
• scientific article; zbMATH DE number 3976331
• Deadlock avoidance with a modified banker's algorithm
• Publication:4727428

zbMATH Keywords

optimizationspanning treesefficient algorithmsoperating systems

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited In (13)

• Deadlock avoidance with a modified banker's algorithm
• Safe states in banker-like resource allocation problems
• The Banker's problem with precedences
• On optimal management of resources in distributed networks
• Title not available (Why is that?)
• Construction of Deadlock-free Designs of Communication Protocols from Observations
• A parallel multi-unit resource deadlock detection algorithm with \(O(\log _2(\min (m, n)))\) overall run-time complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cut-off theorems for the \textit{PV}-model
• Deadlock-freedom in resource contentions
• Deadlock prevention with collectively occupied resources

This page was built for publication: Design of Minimum-Cost Deadlock-Free Systems

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