Deadlock avoidance with a modified banker's algorithm

DOI10.1007/BF01933724MaRDI QIDQ1091127zbMATH OpenFDO

Authors Ferenc Belik

Publication date 1987

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

recoverydeadlock detectiondeadlock preventiondeadlock avoidancedeadlocks in resource allocation systems

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Theory of operating systems (68N25)

Recommendations

• Deadlock prevention with collectively occupied resources
• scientific article; zbMATH DE number 3864482
• Time efficient deadlock resolution algorithms
• Design of Minimum-Cost Deadlock-Free Systems
• A new algorithm for deadlock avoidance

Cites work

• scientific article; zbMATH DE number 43081 (Why is no real title available?)
• Prevention of system deadlocks
• Testing Deadlock-Freedom of Computer Systems

Cited in

(7)

• A new algorithm for deadlock avoidance
• scientific article; zbMATH DE number 4058845 (Why is no real title available?)
• The Banker's problem with precedences
• A fair Banker's Algorithm for read and write locks
• Design of Minimum-Cost Deadlock-Free Systems
• scientific article; zbMATH DE number 3864482 (Why is no real title available?)
• Deadlock prevention with collectively occupied resources

This page was built for publication: Deadlock avoidance with a modified banker's algorithm

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