A foundation for designing deadlock-free routing algorithms in wormhole networks

DOI10.1145/636865.636869MaRDI QIDQ3455563zbMATH OpenOpenAlexFDO

Authors D. N. Jayasimha, Loren Schwiebert, D. Manivannan, Jeff A. May

Publication date 7 December 2015

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• A generic design methodology for deadlock-free routing in multicomputer networks
• Requirements for Deadlock-Free, Adaptive Packet Routing
• scientific article; zbMATH DE number 1156659
• Requirements for deadlock-free, adaptive packet routing

Cited in

(8)

• Requirements for Deadlock-Free, Adaptive Packet Routing
• Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks
• scientific article; zbMATH DE number 1156659 (Why is no real title available?)
• Requirements for deadlock-free, adaptive packet routing
• A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes
• A formal proof of a necessary and sufficient condition for deadlock-free adaptive networks
• The multi-level communication: Efficient routing for interconnection networks
• A generic design methodology for deadlock-free routing in multicomputer networks

This page was built for publication: A foundation for designing deadlock-free routing algorithms in wormhole networks

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