Loading...

A deadlock free shortest path routing algorithm for WK-recursive meshes

Rezazad, M ; Sharif University of Technology | 2008

305 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-77444-0_27
  3. Publisher: Springer Verlag , 2008
  4. Abstract:
  5. 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. © Springer-Verlag Berlin Heidelberg 2008
  6. Keywords:
  7. Mesh generation ; Motion planning ; Routers ; Routing algorithms ; Deadlock free routing algorithm ; Shortest path routing ; Computer system recovery
  8. Source: 9th International Conference on Distributed Computing and Networking, ICDCN 2008, Kolkata, 5 January 2008 through 8 January 2008 ; Volume 4904 LNCS , 2008 , Pages 280-285 ; 03029743 (ISSN); 3540774432 (ISBN); 9783540774433 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-540-77444-0_27