A Routing Algorithm for Proposed Concentric Rings Topological Networks

Interconnection Network Topology plays a very important role in style of distributed systems. As a result of performance of load balancing/task allocations techniques is depends on performance of network. Therefore before discussing optimized task allocation/load equalization theme there’s a requirement of investigate the interconnection topology. Range of interconnection networks is offered in literature like hypercube, mesh, star, tree, de Bruijn and etc. networks. therefore we’ve got planned another constant degree, scalable straightforward routing networks named as concentric rings (m) in this paper, during which rings can be increased as per demand and our results shows that the overheads at significant load will to decreases conjointly.

[1]  Ge-Ming Chiu,et al.  Efficient Fault-Tolerant Multicast Scheme for Hypercube Multicomputers , 1998, IEEE Trans. Parallel Distributed Syst..

[2]  Emad Abuelrub.  A Comparative Study on the Topological Properties of the Hyper-Mesh Interconnection Network , 2008 .

[3]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[4]  Ahmed Louri,et al.  A Spanning Multichannel Linked Hypercube: A Gradually Scalable Optical Interconnection Network for Massively Parallel Computing , 1998, IEEE Trans. Parallel Distributed Syst..

[5]  Kemal Efe,et al.  The Crossed Cube Architecture for Parallel Computation , 1992, IEEE Trans. Parallel Distributed Syst..

[6]  Alexander V. Veidenbaum,et al.  Interconnection network organization and its impact on performance and cost in shared memory multiprocessors , 1999, Parallel Comput..

[7]  Khaled Day,et al.  The Hyperstar Interconnection Network , 1998, J. Parallel Distributed Comput..

[8]  Ralf Klasing.  Improved Compressions of Cube-Connected Cycles Networks , 1998, IEEE Trans. Parallel Distributed Syst..

[9]  Dhiraj K. Pradhan,et al.  The Hyper-deBruijn Networks: Scalable Versatile Architecture , 1993, IEEE Trans. Parallel Distributed Syst..

[10]  A Louri,et al.  Scalable optical hypercube-based interconnection network for massively parallel computing. , 1994, Applied optics.

[11]  Magdy A. Bayoumi,et al.  The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems , 1994, IEEE Trans. Parallel Distributed Syst..

[12]  A. Sharieh,et al.  Hex-Cell: Modeling, Topological Properties and Routing Algorithm , 2008 .

[13]  Antonio Robles,et al.  A routing methodology for achieving fault tolerance in direct networks , 2006, IEEE Transactions on Computers.

[14]  Richard W. Hall,et al.  An Efficient Class of Interconnection Networks for Parallel Computations , 1994, Comput. J..

[15]  Mohamed Ould-Khaoua,et al.  Unsafety vectors: a new fault-tolerant routing for the binary n-cube , 2002, J. Syst. Archit..

[16]  Seung Ryoul Maeng,et al.  Multistage ring network: An interconnection network for large scale shared memory multiprocessors , 2000, J. Syst. Archit..

[17]  M. J. Quinn,et al.  Parallel Computing: Theory and Practice , 1994 .

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

[19]  A. K. Banerjee,et al.  Hyper Petersen network: yet another hypercube-like topology , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[20]  Selim G. Akl.  Parallel computation: models and methods , 1997 .

[21]  Chu Shik Jhon,et al.  Performance evaluation of modified hierarchical ring by exploiting link utilization and memory access locality , 2005, Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005..

[22]  Bhagirath Narahari,et al.  The Banyan-Hypercube Networks , 1990, IEEE Trans. Parallel Distributed Syst..