Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks

DOI10.1109/TCOM.1984.1096151MaRDI QIDQ3334062zbMATH OpenOpenAlexWikidataFDO

Authors Jacek Blazewicz, Daniel P. Bovet, Giorgio Gambosi

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.1096151

zbMATH Keywords

deadlock recoverydistributed proceduresflow controlstore-and-forward networks

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• Predicting deadlock in store‐and‐forward networks
• scientific article; zbMATH DE number 4090795
• Static deadlock prevention in dynamically configured communication networks
• A deadlock free and starvation free network of packet switching communication processors
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Deadlock-free message routing in multicomputer networks
• An Efficient and Deadlock-Free Network Reconfiguration Protocol
• Optimization aspects of deadlock prevention in packet-switching networks

Cited in

(4)

• Time-Stamp Approach to Store-and-Forward Deadlock Prevention
• scientific article; zbMATH DE number 4090795 (Why is no real title available?)
• Optimal centralized algorithms for store-and-forward deadlock avoidance
• Predicting deadlock in store‐and‐forward networks

This page was built for publication: Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks

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