
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ada Waichee Fu, SiuCheung Chau, "CyclicCubes: A New Family of Interconnection Networks of Even FixedDegrees," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 12, pp. 12531268, December, 1998.  
BibTex  x  
@article{ 10.1109/71.737700, author = {Ada Waichee Fu and SiuCheung Chau}, title = {CyclicCubes: A New Family of Interconnection Networks of Even FixedDegrees}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {12}, issn = {10459219}, year = {1998}, pages = {12531268}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.737700}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  CyclicCubes: A New Family of Interconnection Networks of Even FixedDegrees IS  12 SN  10459219 SP1253 EP1268 EPD  12531268 A1  Ada Waichee Fu, A1  SiuCheung Chau, PY  1998 KW  Cayley graphs KW  generalized hypercube KW  fixed degree KW  interconnection. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We introduce a new family of interconnection networks that are Cayley graphs with fixed degrees of any even number greater than or equal to four. We call the proposed graphs cycliccubes because contracting some cycles in such a graph results in a generalized hypercube. These Cayley graphs have optimal fault tolerance and logarithmic diameters. For comparable number of nodes, a cycliccube can have a diameter smaller than previously known fixeddegree networks. The proposed graphs can adopt an optimum routing algorithm known for one of its subfamilies of Cayley graphs. We also show that a graph in the new family has a Hamiltonian cycle and, hence, there is an embedding of a ring. Embedding of meshes and hypercubes are also discussed.
[1] S.B. Akers and B. Krishnamurthy, "On Group Graphs and Their Fault Tolerance," IEEE Trans. Computers, vol. 36, no. 7, pp. 885888, July 1987.
[2] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[3] S. Lakshmivarahan, J.S. Jwo, and S.K. Dhall, "Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey," Parallel Computing, vol. 19, pp. 361407, 1993.
[4] S.R. Öhring and S.K. Das, "The Folded Petersen Cube Network: New Competitors for the Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 2, pp. 151168, Feb. 1996.
[5] S. Öhring, F. Sarkar, S.K. Das, and D.H. Hohndel, "Cayley Graph Connected Cycles: A New Class of FixedDegree Interconnection Networks," Proc. Int'l Conf. Systems Sciences, pp. 479487, 1995.
[6] F.P. Preparata and J. Vuillemin, “The CubeConnected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300309, 1981.
[7] 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. 2632, Jan. 1996.
[8] C.L. Seitz et al., "The Architecture and Programming of the Ametak Series 2010," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 3337, Jan. 1988.
[9] C.L. Seitz et al., "Submicron Systems Architecture Project Semiannual Technical Report," Technical Report CaltecCSTR8818, Calif. Inst. of Tech nology, Nov. 1988.
[10] W.J. Dally et al., The JMachine: A FineGrain Concurrent Computer. Elsevier Science Publishers B.V., 1989.
[11] W.J. Dally, "The MessageDriven Processor: A Multicomputer Processing Node with Efficient Mechanisms," IEEE Micro, pp. 2339, Apr. 1992.
[12] S. Borkar, R. Cohn, G. Cox, S. Gleason, T. Gross, H.T. Kung, M. Lam, B. Moore, C. Peterson, J. Pieper, L. Rankin, P.S. Tseng, J. Sutton, J. Urbanski, and J. Webb iWarp: An Integrated Solution to HighSpeed Parallel Computing, Proc. 1988 Int'l Conf. Supercomputing, pp. 330339., IEEE CS and ACM SIGARCH, Orlando, Fla., Nov. 1988.
[13] B. Bose, B. Broeg, Y. Kwon, and Y. Ashir, "Lee Distance and Topological Properties of kAry nCubes," IEEE Trans. Computers, vol. 44, no. 8, pp. 1,0211,030, Aug. 1995.
[14] N.F. Tzeng and S. Wei, “Enhanced Hypercubes,” IEEE Trans. Computers, vol. 40, no. 3, pp. 284294, Mar. 1991.
[15] A. ElAmawy and S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 3142, 1991.
[16] D.K. Pradhan, "Fault Tolerant VLSI Architectures Based on de Bruijn Graphs (Galileo in the Mid Nineties)," DIMACS Series Discrete Math., vol. 5, 1991.
[17] B. Alspach, "Cayley Graphs with Optimal Fault Tolerance," IEEE Trans. Computers, vol. 41, no. 10, pp. 1,3371,339, Oct. 1992.
[18] L.N. Bhuyan and D.P. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. 33, no. 4, pp. 323333, Apr. 1984.
[19] F. Harary, Graph Theory. Addison Wesley, 1971.
[20] G.A. Dirac, "Generalizations du Theoreme de Menger," C.R. Academie Science Paris, pp. 4,2524,253, 1960.
[21] K. Menger, "Zur Allgemeinen Kurventheorie," Fundamentals Math., pp. 96115, 1927.
[22] P.T. Gaugham and S. Yalamanchilli, "Adaptive Routing Protocols for Hypercube Interconnection Networks," Computer, May 1993.
[23] M. Marsic, "Hamiltonian Circuits in Cayley Graphs," Discrete Math., pp. 4954, 1982.
[24] A. Tucker, Applied Combinatorics, second ed. John Wiley and Sons, 1984.
[25] P. Ramanathan and S. Chalasani, "Resource Placement with Multiple Adjacency Constraints in kAry nCubes," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 5, pp. 511519, May 1995.