A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes

DOI10.1007/978-3-540-77444-0_27zbMath1131.68344OpenAlexW1662097207MaRDI QIDQ5445767

Mostafa Rezazad, M. Hoseiny Farahabady, Hamid Sarbazi-Azad

Publication date: 6 March 2008

Published in: Distributed Computing and Networking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77444-0_27

zbMATH Keywords

shortest path routingWK-recursiveDeadlock Free Routing Algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (2)

A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes ⋮ A new modelling approach of wormhole-switched networks with finite buffers

Cites Work

• An adaptive routing algorithm for WK-recursive topologies
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes

This page was built for publication: A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes