Design of Minimum-Cost Deadlock-Free Systems

DOI10.1145/2157.322403MaRDI QIDQ3763583zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

efficient algorithmsoperating systemsoptimizationspanning trees

Mathematics Subject Classification ID

Theory of operating systems (68N25)

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

Cited in

(15)

• Deadlock prevention with collectively occupied resources
• Deadlock avoidance with a modified banker's algorithm
• Time efficient deadlock resolution algorithms
• On optimal management of resources in distributed networks
• scientific article; zbMATH DE number 3864482 (Why is no real title available?)
• scientific article; zbMATH DE number 3938552 (Why is no real title available?)
• scientific article; zbMATH DE number 3949689 (Why is no real title available?)
• scientific article; zbMATH DE number 3976331 (Why is no real title available?)
• Random Resource Allocation Graphs and the Probability of Deadlock
• Construction of Deadlock-free Designs of Communication Protocols from Observations
• Safe states in banker-like resource allocation problems
• The Banker's problem with precedences
• Cut-off theorems for the \textit{PV}-model
• A parallel multi-unit resource deadlock detection algorithm with \(O(\log _2(\min (m, n)))\) overall run-time complexity
• Deadlock-freedom in resource contentions

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)