A Permutation Routing Algorithm for Double Loop Networks
1997 ◽
Vol 07
(03)
◽
pp. 259-265
◽
Keyword(s):
Double-loop networks are popular architectures for interconnecting networks. We show that these networks have parallel processing capability by giving the first permutation routing algorithm. Furthermore, we show that the number of routing steps required is equal to the diameter of the network, the best bound one can get.
2005 ◽
Vol 16
(9)
◽
pp. 841-852
◽
Keyword(s):
2005 ◽
pp. 308-316
Keyword(s):
2013 ◽
Vol 468
◽
pp. 50-58
◽
1999 ◽
Vol 70
(6)
◽
pp. 259-264
◽
Keyword(s):
2003 ◽
Vol 48
(13-15)
◽
pp. 387-402
◽
1992 ◽
Vol 03
(03)
◽
pp. 323-331
◽
Keyword(s):
1998 ◽
Vol 65
(5)
◽
pp. 255-260
◽