Prevention of system deadlocks

DOI10.1145/363156.363160zbMATH Open0184.20602OpenAlexW2104508180MaRDI QIDQ5576027FDOQ5576027

Authors: A. N. Habermann 

Publication date: 1969

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

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

zbMATH Keywords

computer science and automata

Cited In (20)

• Deadlock avoidance with a modified banker's algorithm
• The parallel complexity of deadlock detection
• A graph model for scheduling processes in systems with parallel computations
• Probabilistic models of computer deadlock
• Functional behavior in data spaces
• A new safety test for deadlock avoidance
• A new algorithm for deadlock avoidance
• The Banker's problem with precedences
• Program control of operating systems
• A linear algorithm of a deadlock avoidance for nonpreemptible resources
• Deadlock prediction and avoidance based on Petri nets for zone-control automated guided vehicle systems
• A fair Banker's Algorithm for read and write locks
• Easy cases of deadlock detection in train scheduling
• New trends in machine scheduling
• A structured approach to deadlock detection, avoidance and resolution in flexible manufacturing systems
• Control of deadlock and blocking for production systems with unreliable workstations
• Title not available (Why is that?)
• Deadlock-freedom in resource contentions
• Job scheduling guaranteing reasonable turn-around times
• Scheduling according to job priority with prevention of deadlock and permanent blocking

This page was built for publication: Prevention of system deadlocks

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