Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms

DOI10.1016/S0020-0190(00)00022-3zbMath1338.68015OpenAlexW1966252990MaRDI QIDQ294745

Daniel Štefanković

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000223?np=y

zbMATH Keywords

interconnection networksacyclic orientationsdeadlock-free packet routing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing

Cites Work

• Unnamed Item
• Deadlock-Free Packet Switching Networks
• Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Efficient deadlock-free routing
• Requirements for deadlock-free, adaptive packet routing

This page was built for publication: Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms