The Optical Chained-Cubic Tree interconnection network: Topological structure and properties

Interconnection networks with optical communication links outperform others using electronic communication links when the distance is long in terms of speed and power consumption. However, for short distances, electronic network topologies are preferred due to lower material cost requirements. As a result, hybrid network topologies were constructed to combine the benefits of both types of network topologies, such as Optical Transpose Interconnection System (OTIS). This paper presents a new hybrid interconnection network topology, which is constructed using both optical and electronic links, called the Optical Chained-Cubic Tree (OCCT). This new OCCT topology is based on the Chained-Cubic Tree (CCT) interconnection network and is designed to cope with both types of binary trees; full and complete. Also, the topological properties of OCCT in terms of diameter, connectivity, degree, bisection width, and cost are presented and compared with OTIS-Mesh and CCT interconnection networks.

[1]  Basel A. Mahafzah,et al.  The load balancing problem in OTIS-Hypercube interconnection networks , 2008, The Journal of Supercomputing.

[2]  Sartaj Sahni.  Models and algorithms for optical and optoelectronic parallel computers , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[3]  Wenjun Xiao,et al.  Biswapped Networks and Their Topological Properties , 2007 .

[4]  S C Esener,et al.  Optical transpose interconnection system architectures. , 1993, Optics letters.

[5]  Mohamed Ould-Khaoua,et al.  Generalized methods for algorithm development on optical systems , 2006, The Journal of Supercomputing.

[6]  Sartaj Sahni,et al.  Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer , 2001, IEEE Trans. Computers.

[7]  Majid Ahmadi,et al.  Performance of Manhattan street network (MSN) architecture under zonal traffic distribution (ZTD) patterns , 1991 .

[8]  Sartaj Sahni,et al.  Basic Operations on the OTIS-Mesh Optoelectronic Computer , 1998, IEEE Trans. Parallel Distributed Syst..

[9]  Hamid Sarbazi-Azad,et al.  Broadcast Algorithms on OTIS-Cubes , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications.

[10]  Abdel Elah Al-Ayyoub,et al.  Topological Properties of OTIS-Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[11]  Andre Osterloh,et al.  Sorting on the OTIS-mesh , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[12]  Rajib K. Das,et al.  Diameter and Routing in Enhanced OTIS Cube , 2007, 2007 International Conference on Computing: Theory and Applications (ICCTA'07).

[13]  Basel A. Mahafzah,et al.  Performance evaluation of broadcast and global combine operations in all-port wormhole-routed OTIS-Mesh interconnection networks , 2010, Cluster Computing.

[14]  Shin-Shin Kao,et al.  Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even , 2010, Comput. Electr. Eng..

[15]  Wenjun Xiao,et al.  Swapped (OTIS) Networks Built of Connected Basis Networks Are Maximally Fault Tolerant , 2009, IEEE Transactions on Parallel and Distributed Systems.

[16]  Dan Meng,et al.  Virtualizing Modern High-Speed Interconnection Networks with Performance and Scalability , 2010, 2010 IEEE International Conference on Cluster Computing.

[17]  Basel A. Mahafzah,et al.  The hybrid dynamic parallel scheduling algorithm for load balancing on Chained-Cubic Tree interconnection networks , 2010, The Journal of Supercomputing.

[18]  Prasanta K. Jana,et al.  An Efficient Parallel Sorting Algorithm on OTIS Mesh of Trees , 2009, 2009 IEEE International Advance Computing Conference.

[19]  Xiaofan Yang,et al.  Embedding multi-dimensional meshes into twisted cubes , 2010, Comput. Electr. Eng..

[20]  Hesham El-Rewini,et al.  Advanced Computer Architecture and Parallel Processing (Wiley Series on Parallel and Distributed Computing) , 2005 .

[21]  Ramamohan Paturi,et al.  Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS) , 2000, J. Parallel Distributed Comput..

[22]  David Coudert,et al.  Isomorphisms of the De Bruijn digraph and free-space optical networks , 2002, Networks.

[23]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[24]  S. A. Ghozati,et al.  The fastcube: a variation on hypercube topology with lower diameter , 2003, Comput. Electr. Eng..

[25]  Khaled Day,et al.  Optical transpose k-ary n-cube networks , 2004, J. Syst. Archit..

[26]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[27]  Jean-Luc Dekeyser,et al.  A study of an evaluation methodology for unbuffered multistage interconnection networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[28]  B. Khasnabish.  Topological properties of Manhattan street networks , 1989 .

[29]  D Coudert,et al.  Topologies for optical interconnection networks based on the optical transpose interconnection system. , 2000, Applied optics.

[30]  Sartaj Sahni,et al.  Randomized Routing, Selection, and Sorting on the OTIS-Mesh , 1998, IEEE Trans. Parallel Distributed Syst..

[31]  Laxmi N. Bhuyan.  Guest Editor's Introduction Interconnection Networks for Parallel and Distributed Processing , 1987, Computer.

[32]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[33]  S. Ghozati,et al.  The k-ary n-cube network : modeling, topological properties and routing strategies , 1999 .

[34]  Hesham El-Rewini,et al.  Advanced Computer Architecture and Parallel Processing , 2005 .

[35]  Emad Abuelrub,et al.  The chained-cubic tree interconnection network , 2011, Int. Arab J. Inf. Technol..

[36]  Sartaj Sahni,et al.  Otis Optoelectronic Computers , 1998 .