Optimal Routing in Binomial Graph Networks

A circulant graph with n nodes and jumps j1, j2,..., jm is a graph in which each node i, 0 les i les n-1, is adjacent to all the vertices i plusmn jk mod n, where 1 les k les m. A binomial graph network (BMG) is a circulant graph where jk is the power of 2 that is less than or equal to n. This paper presents an optimal (shortest path) two-terminal routing algorithm for BMG networks. This algorithm uses only the destination address to determine the next hop in order to stay on the shortest path. Unlike the original algorithms, it does not require extra space for routing tables or additional information in the packet. The experimental results show that the new optimal algorithm is significantly faster than the original optimal algorithm.

[1]  George Bosilca,et al.  Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology , 2007, ISPA.

[2]  Janez Zerovnik,et al.  An optimal message routing algorithm for circulant networks , 2006, J. Syst. Archit..

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

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

[5]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[6]  Hans Werner Meuer,et al.  Top500 Supercomputer Sites , 1997 .

[7]  N. F. Maxemchuk,et al.  Regular mesh topologies in local and metropolitan area networks , 1985, AT&T Technical Journal.

[8]  Andrew L. Wendelborn,et al.  Distributed, parallel Web service orchestration using XSLT , 2005, First International Conference on e-Science and Grid Computing (e-Science'05).

[9]  Simon L. Peyton Jones,et al.  Haskell on a shared-memory multiprocessor , 2005, Haskell '05.

[10]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[11]  D. Frank Hsu,et al.  Distributed Loop Computer Networks: A Survey , 1995, J. Parallel Distributed Comput..

[12]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[13]  Jack J. Dongarra,et al.  Scalable Fault Tolerant Protocol for Parallel Runtime Environments , 2006, PVM/MPI.

[14]  M. J. Karol.  Optical interconnection using ShuffleNet multihop networks in multi-connected ring topologies , 1988, SIGCOMM 1988.

[15]  Thomas Johnsson,et al.  Parallel graph reduction with the (v , G)-machine , 1989, FPCA.

[16]  Mohan Kumar,et al.  Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes , 1992, IEEE Trans. Parallel Distributed Syst..

[17]  Joe L. Armstrong.  The development of Erlang , 1997, ICFP '97.

[18]  Dharma P. Agrawal,et al.  dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout , 1993, IEEE Trans. Parallel Distributed Syst..

[19]  Abhijit Sengupta,et al.  On a Lightwave Network Topology Using Kauts Digraphs , 1999, IEEE Trans. Computers.

[20]  Ahmed Louri,et al.  A spanning bus connected hypercube: a new scalable optical interconnection network for multiprocessors and massively parallel systems , 1997 .

[21]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[22]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[23]  Bernard Mans,et al.  On Routing in Circulant Graphs , 1999, COCOON.

[24]  Kumar N. Sivarajan,et al.  Lightwave networks based on de Bruijn graphs , 1994, TNET.

[25]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[26]  Douglas Thain,et al.  Distributed computing in practice: the Condor experience , 2005, Concurr. Pract. Exp..

[27]  Mohan Kumar,et al.  The hierarchical cliques interconnection network , 2004, J. Parallel Distributed Comput..

[28]  Carlo H. Séquin,et al.  Hypertree: A Multiprocessor Interconnection Topology , 1981, IEEE Transactions on Computers.

[29]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[30]  Ahmed Louri,et al.  An optical multi-mesh hypercube: a scalable optical interconnection network for massively parallel computing , 1994 .

[31]  Arnold L. Rosenberg,et al.  A Tool for Prioritizing DAGMan Jobs and its Evaluation , 2007, Journal of Grid Computing.

[32]  Jack Dongarra,et al.  PVM: Experiences, current status and future direction , 1993, Supercomputing '93. Proceedings.

[33]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[34]  Dilip Sarkar,et al.  Hypercube connected rings: a scalable and fault-tolerant logical topology for optical networks , 2001, Comput. Commun..

[35]  Carl Kesselman,et al.  Generalized communicators in the Message Passing Interface , 1996, Proceedings. Second MPI Developer's Conference.

[36]  Nian-Feng Tzeng,et al.  Enhanced Hypercubes , 1991, IEEE Trans. Computers.

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

[38]  Agustin Arruabarrena,et al.  Optimal Distance Networks of Low Degree for Parallel Computers , 1991, IEEE Trans. Computers.

[39]  Wolfgang Gentzsch,et al.  Sun Grid Engine: towards creating a compute power grid , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[40]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[41]  Andrew L. Wendelborn,et al.  Compilation of XSLT into dataflow graphs for Web service composition , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[42]  Simon L. Peyton Jones,et al.  GUM: a portable parallel implementation of Haskell , 1996, PLDI '96.

[43]  Sajal K. Das,et al.  Folded Petersen Cube Networks: New Competitors for the Hypercubes , 1996, IEEE Trans. Parallel Distributed Syst..

[44]  Gurmeet Singh Manku,et al.  Optimal routing in Chord , 2004, SODA '04.

[45]  Ilyong Chung.  Construction of a parallel and shortest routing algorithm on recursive circulant networks , 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.

[46]  Lennart Augustsson,et al.  A compiler for lazy ML , 1984, LFP '84.