“School of Computer Science”
Back to Papers HomeBack to Papers of School of Computer Science
| Paper IPM / Computer Science / 11029 |
|
||||||
| Abstract: | |||||||
|
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.
Download TeX format |
|||||||
| back to top | |||||||
