Time-Stamp Approach to Store-and-Forward Deadlock Prevention

DOI10.1109/TCOM.1987.1096799MaRDI QIDQ3768391zbMATH OpenOpenAlexWikidataFDO

Authors Jacek Blazewicz, Jerzy Brzeziński, Giorgio Gambosi

Publication date 1987

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

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

zbMATH Keywords

distributed flow control procedurestore-and-forward deadlock preventionstore-and-forward networksunrestricted packet routing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Recommendations

• Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks
• scientific article; zbMATH DE number 4090795
• Predicting deadlock in store‐and‐forward networks
• Optimal centralized algorithms for store-and-forward deadlock avoidance
• DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING

Cited in

(3)

• Optimization aspects of deadlock prevention in packet-switching networks
• Locking Timestamps versus Locking Objects
• Predicting deadlock in store‐and‐forward networks

This page was built for publication: Time-Stamp Approach to Store-and-Forward Deadlock Prevention

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