Low Diameter Interconnections for Routing in High-Performance Parallel Systems

A new class of low diameter interconnections (LDI) is proposed for high-performance computer systems that are augmented with circuit switching networks. In these systems, the network is configured to match the communication patterns of applications, when these patterns exhibit temporal locality, and to embed a logical topology to route traffic that does not exhibit locality. The new LDI topology is a surprisingly simple directed graph which minimizes the network diameter for a given node degree and number of nodes. It can be easily embedded in circuit switching networks to route random traffic with high bandwidth and low latency

[1]  Rami G. Melhem,et al.  Switch design to enable predictive multiplexed switching in multiprocessor networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[2]  S. Louis Hakimi,et al.  Fault-Tolerant Routing in DeBruijn Comrnunication Networks , 1985, IEEE Transactions on Computers.

[3]  Miguel Angel Fiol,et al.  The Partial Line Digraph Technique in the Design of Large Interconnection Networks , 1992, IEEE Trans. Computers.

[4]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[5]  Xin Yuan,et al.  A Message Scheduling Scheme for All-to-All Personalized Communication on Ethernet Switched Clusters , 2007, IEEE Transactions on Parallel and Distributed Systems.

[6]  Rami G. Melhem,et al.  Reconfiguration with Time Division Multiplexed MIN's for Multiprocessor , 1994, IEEE Trans. Parallel Distributed Syst..

[7]  Xin Yuan,et al.  Automatic generation and tuning of MPI collective communication routines , 2005, ICS '05.

[8]  Ralf Steinmetz,et al.  Overlay Design Mechanisms for Heterogeneous, Large-Scale, Dynamic P2P Systems , 2004, Journal of Network and Systems Management.

[9]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[10]  M. J. Karol,et al.  ShuffleNet: an application of generalized perfect shuffles to multihop lightwave networks , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[11]  Makoto Imase,et al.  A Design for Directed Graphs with Minimum Diameter , 1983, IEEE Transactions on Computers.

[12]  Cauligi S. Raghavendra,et al.  Fault-Tolerant Networks Based on the de Bruijn Graph , 1991, IEEE Trans. Computers.

[13]  Rami G. Melhem,et al.  On the Feasibility of Optical Circuit Switching for High Performance Computing Systems , 2005, ACM/IEEE SC 2005 Conference (SC'05).

[14]  Andrew A. Chien,et al.  The OptIPuter , 2003, CACM.

[15]  C. Qiao,et al.  Reconfiguration With Time Division Multiplexed MINs for Multiprocessor Communications , 1994 .

[16]  Wu-chun Feng,et al.  CHEETAH: circuit-switched high-speed end-to-end transport architecture , 2003, OptiComm: Optical Networking and Communications Conference.

[17]  Leonid Oliker,et al.  Analyzing Ultra-Scale Application Communication Requirements for a Reconfigurable Hybrid Interconnect , 2005, ACM/IEEE SC 2005 Conference (SC'05).

[18]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[19]  Xin Yuan,et al.  Message scheduling for all-to-all personalized communication on ethernet switched clusters , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[20]  Sam Toueg,et al.  On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.

[21]  Mario Gerla,et al.  Routing in the bidirectional shufflenet , 2001, TNET.

[22]  Bernard Elspas,et al.  THEORY OF CELLULAR LOGIC NETWORKS AND MACHINES. , 1968 .

[23]  Miguel Angel Fiol,et al.  Vertex-symmetric digraphs with small diameter , 1995 .