Using Barrier Graphs for Deadlock Prevention in Communication Networks

DOI10.1109/TCOM.1984.1096160zbMATH Open0544.94027OpenAlexW2099418423MaRDI QIDQ3335693FDOQ3335693

Authors: Wolfgang Wimmer 

Publication date: 1984

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1984.1096160

Recommendations

• Static deadlock prevention in dynamically configured communication networks
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Deadlock prevention by acyclic orientations
• scientific article; zbMATH DE number 3926230
• And/or-convexity: a graph convexity based on processes and deadlock models

zbMATH Keywords

computer networksbarrier graphdeadlock-free communication networks

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cited In (3)

• And/or-convexity: a graph convexity based on processes and deadlock models
• Optimization aspects of deadlock prevention in packet-switching networks
• Characterization of deadlocks in irregular networks

This page was built for publication: Using Barrier Graphs for Deadlock Prevention in Communication Networks

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