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

DOI10.1145/636865.636869zbMATH Open1326.68037OpenAlexW2027173239MaRDI QIDQ3455563FDOQ3455563

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks
• Requirements for deadlock-free, adaptive packet routing
• A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes
• Requirements for Deadlock-Free, Adaptive Packet Routing
• A generic design methodology for deadlock-free routing in multicomputer networks
• The multi-level communication: Efficient routing for interconnection networks
• A formal proof of a necessary and sufficient condition for deadlock-free adaptive 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)