A New Two-Dimensional Mesh Topology with Optical Interlinks

The performance of parallel computer heavily depends on the topology of the interconnection network. Two-dimensional mesh is a well-known topology for processor arrays. However, its large diameter increases execution time when the parallel algorithm requires communication between arbitrary pair of nodes. Wraparound connections between end nodes reduces its diameter, however, increases the complexity in the design of parallel algorithms. In this paper, we have proposed an intermediate approach, where additional links are used to reduce the diameter without increasing the design complexity. These additional optical links provides high-speed communication between nodes that are separated by half the number of nodes in each dimension. Also, we present efficient parallel algorithms for some elementary problems on the proposed system.

[1]  D. Frank Hsu,et al.  Combinatorial properties of mesh of trees , 2000, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000.

[2]  Allan Porterfield,et al.  The Tera computer system , 1990 .

[3]  Prasanta K. Jana,et al.  Multi-mesh of trees with its parallel algorithms , 2004, J. Syst. Archit..

[4]  Steven L. Scott,et al.  Optimized Routing in the Cray T3D , 1994, PCRCW.

[5]  Ömer Egecioglu,et al.  Optimal Parallel Prefix on Mesh Architectures , 1993, Parallel Algorithms Appl..

[6]  Sudhanshu Kumar Jha An Improved Parallel Prefix Computation on 2D-Mesh Network , 2013 .

[7]  Subir Bandyopadhyay,et al.  OMULT: An Optical Interconnection System for Parallel Computing , 2004, Euro-Par.

[8]  George L.-T. Chiu,et al.  Overview of the Blue Gene/L system architecture , 2005, IBM J. Res. Dev..