Requirements for Deadlock-Free, Adaptive Packet Routing

DOI10.1137/S0097539792231830MaRDI QIDQ4327423zbMATH OpenFDO

Authors Robert Cypher, Luis Gravano

Publication date 6 April 1995

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539792231830

zbMATH Keywords

distributed architecturespacket routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• Requirements for deadlock-free, adaptive packet routing
• Planar-adaptive routing
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• A foundation for designing deadlock-free routing algorithms in wormhole networks
• Deadlock-free message routing in multicomputer networks

Cited in

(16)

• Optimization aspects of deadlock prevention in packet-switching networks
• Deadlock prevention by acyclic orientations
• Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
• A foundation for designing deadlock-free routing algorithms in wormhole networks
• scientific article; zbMATH DE number 1340884 (Why is no real title available?)
• Approximating the buffer allocation problem using epochs
• Planar-adaptive routing
• Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks
• Optimal centralized algorithms for store-and-forward deadlock avoidance
• Valved routing: efficient flow control for adaptive nonminimal routing in interconnection networks
• scientific article; zbMATH DE number 1760003 (Why is no real title available?)
• Requirements for deadlock-free, adaptive packet routing
• A formal proof of a necessary and sufficient condition for deadlock-free adaptive networks
• On the flattest common supersequence method for deadlock-free routing in arbitrary networks
• Evaluation of crossbar architectures for deadlock recovery routers
• A simple livelock-free algorithm for packet switching

This page was built for publication: Requirements for Deadlock-Free, Adaptive Packet Routing

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