Deadlock prevention by acyclic orientations

DOI10.1016/S0166-218X(02)00232-9zbMath1023.68127OpenAlexW2087462236MaRDI QIDQ1399106

Michele Flammini, Miriam Di Ianni, Jean-Claude Bermond, Stéphane Pérennes

Publication date: 30 July 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00232-9

zbMATH Keywords

parallel algorithmscomputational and structural complexityrouting and communication in interconnection networks

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

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

Cites Work

• Unnamed Item
• How to emulate shared memory
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• 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: Deadlock prevention by acyclic orientations