A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes
| Autor: | Hamid Sarbazi-Azad, M. Hoseiny Farahabady, Mostafa Rezazad |
|---|---|
| Rok vydání: | 2007 |
| Předmět: |
Static routing
Dynamic Source Routing Private Network-to-Network Interface Link-state routing protocol Computer science Equal-cost multi-path routing Distributed computing Hardware_INTEGRATEDCIRCUITS Path vector protocol K shortest path routing Parallel computing Destination-Sequenced Distance Vector routing |
| Zdroj: | Distributed Computing and Networking ISBN: 9783540774433 ICDCN |
| DOI: | 10.1007/978-3-540-77444-0_27 |
| Popis: | In this paper, we investigate an efficient deadlock-free shortest path routing algorithm for WK-recursive mesh networks which has been shown that possess several advantages like suitable to be manufactured by VLSI technology and easy to be expanded. It will be shown that the proposed algorithm requires O(√n) routing steps (where N is the network size) to route the entire network by exploiting either the self-routing or second order routing scheme. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|