DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING

DOI10.1142/S012905419000014XMaRDI QIDQ3358213zbMATH OpenOpenAlexFDO

Authors Daniel P. Bovet, Miriam Di Ianni, Pilu Crescenzi

Publication date 1990

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s012905419000014x

zbMATH Keywords

deadlock predictionNP-completenesspolynomial algorithmsStore-and-Forward Network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Predicting deadlock in store‐and‐forward networks
• scientific article; zbMATH DE number 1760003
• scientific article; zbMATH DE number 4090795
• Optimal centralized algorithms for store-and-forward deadlock avoidance
• scientific article; zbMATH DE number 3938552

Cited in

(8)

• scientific article; zbMATH DE number 3938552 (Why is no real title available?)
• Time-Stamp Approach to Store-and-Forward Deadlock Prevention
• scientific article; zbMATH DE number 4090795 (Why is no real title available?)
• scientific article; zbMATH DE number 1760003 (Why is no real title available?)
• scientific article; zbMATH DE number 749818 (Why is no real title available?)
• scientific article; zbMATH DE number 1863315 (Why is no real title available?)
• Predicting deadlock in store‐and‐forward networks
• Avoiding deadlocks via weak deadlock sets

This page was built for publication: DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING

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