A Constant Time Optimal Routing Algorithm for Directed Double Loop Networks

Undirected double-loop networks G(n; ± s1, ± s2), where n is the number of its nodes, s1 and s2 are its steps, 1≤s1<s2<n / 2 and gcd(n, s1, s2)=1, are important interconnection networks. In this paper, by using the four parameters of the L-shape tile and a solution (x,y) of a congruence equation s1x+s2y≡1 (modn), we give a constant time optimal routing algorithm for G(n; ± s1, ± s2).

[1]  Ramamurthy Badrinath,et al.  Finding Shortest Paths in Distributed Loop Networks , 1998, Inf. Process. Lett..

[2]  Ian F. Akyildiz,et al.  Routing Algorithms for Double Loop Networks , 1992, Int. J. Found. Comput. Sci..

[3]  Yuxi Fu,et al.  Computational and Information Science, First International Symposium, CIS 2004, Shanghai, China, December 16-18, 2004, Proceedings , 2004, CIS.

[4]  Mateo Valero,et al.  Discrete Optimization Problem in Local Networks and Data Alignment , 1987, IEEE Transactions on Computers.

[5]  Ying Cheng,et al.  Diameters of Weighted Double Loop Networks , 1988, J. Algorithms.

[6]  Frank K. Hwang,et al.  A survey on multi-loop networks , 2003, Theor. Comput. Sci..

[7]  D. J. Guan,et al.  An Optimal Message Routing Algorithm for Double-Loop Networks , 1998, Inf. Process. Lett..

[8]  Wenjun Xiao,et al.  Optimal Designs of Directed Double-Loop Networks , 2004, CIS.

[9]  Jhing-Fa Wang,et al.  Reliable circulant networks with minimum transmission delay , 1985 .

[10]  F. Aguiló,et al.  An efficient algorithm to find optimal double loop networks , 1995, Discret. Math..

[11]  Frank K. Hwang,et al.  A complementary survey on double-loop networks , 2001, Theor. Comput. Sci..

[12]  Frank K. Hwang,et al.  The Minimum Distance Diagram of Double-Loop Networks , 2000, IEEE Trans. Computers.

[13]  Bhabani P. Sinha,et al.  Fault-Tolerant Routing in Distributed Loop Networks , 1995, IEEE Trans. Computers.

[14]  Chak-Kuen Wong,et al.  A Combinatorial Problem Related to Multimodule Memory Organizations , 1974, JACM.