This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm
December 1999 (vol. 10 no. 12)
pp. 1290-1298

Abstract—In this paper, we first show that the degree four Cayley graph proposed in a paper appearing in the January 1996 issue of IEEE Transactions on Parallel and Distributed Systems is indeed isomorphic to the wrapped butterfly. The isomorphism was first reported by Muga and Wei in the proceedings of PDPTA "96.The isomorphism is shown by using an edge-preserving bijective mapping. Due to the isomorphism, algorithms for the degree four Cayley graph can be easily developed in terms of wrapped butterfly and topological properties of one network can be easily derived in terms of the other. Next, we present the first optimal oblivious one-to-one permutation routing scheme for these networks in terms of the wrapped butterfly. Our algorithm runs in time $O(\sqrt{N})$, where $N$ is the network size.

[1] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[2] J.-C. Bermond, O. Favaron, and M. Mahlo, “Hamiltonian Decomposition of Cayley Graphs of Degree 4,” J. Combinatorial Theory, SerB46, pp. 142-153, 1989.
[3] A. Borodin and J.E. Hopcroft, “Routing, Merging and Sorting on Parallel Models of Computation,” Proc. STOC, pp. 338-344, 1982.
[4] G. Chen and F.C.M. Lau, “Comments on a New Family of Cayley Graph Interconnection Networks of Constant degree Four,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 1,299-1,300, Dec. 1997.
[5] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[6] F. Muga II and D.S.L. Wei, “On the Isomorphism of the Wrapped Butterfly Network and Degree Four Cayley Graph,” Int'l Conf. Parallel and Distributed Processing Techniques and Applications, pp. 403-406, Sunnyvale, Calif., Aug. 1996.
[7] M. Palis, S. Rajasekaran, and D.S.L. Wei, “Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks,” J. Parallel and Distributed Computing, vol. 20, no. 2, pp. 145-157, Feb. 1994.
[8] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300-309, 1981.
[9] S. Rajasekaran and T.H. Tsantilas, “Optimal Routing Algorithms for Mesh-Connected Processor Arrays,” Algorithmica vol. 8, pp. 277-301, 1992.
[10] P. Vadapalli and P.K. Srimani, “A New Family of Cayley Graph Interconnection Networks of Constant Degree Four” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 1, pp. 26-32, Jan. 1996.

Index Terms:
Cayley graph, wrapped butterfly, isomorphism, permutation routing.
Citation:
David S.L. Wei, Felix P. Muga, Kshirasagar Naik, "Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 12, pp. 1290-1298, Dec. 1999, doi:10.1109/71.819950
Usage of this product signifies your acceptance of the Terms of Use.