Deadlock-free routing in k-ary hypercube network in presence of processor failures

DOI10.1016/0020-0190(90)90017-RzbMath0695.68023OpenAlexW1971423961MaRDI QIDQ910198

N. E. Zubov

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90017-r

zbMATH Keywords

routing protocolinterconnection networkdeadlockprocessor failure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25) Theory of software (68N99)

Cites Work

• Unnamed Item
• Virtual cut-through: A new computer communication switching technique
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

This page was built for publication: Deadlock-free routing in k-ary hypercube network in presence of processor failures