Routing multiple paths in hypercubes

We present new techniques for mapping computations onto hypercubes. Our methods speed up classical implementations of grid and tree communications by a factor of Θ(n), wheren is the number of hypercube dimensions. The speedups are asymptotically the best possible.We obtain these speedups by mapping each edge of the guest graph onto short, edge-disjoint paths in the hypercube such that the maximum congestion on any hypercube edge isO(1). These multiple-path embeddings can be used to reduce communication time for large grid-based scientific computations, to increase tolerance to link faults, and for fast routing of large messages.We also develop a general technique for deriving multiple-path embeddings from multiple-copy embeddings. Multiple-copy embeddings are one-to-one maps of independent copies of the guest graph within the hypercube. We present an efficient multiple-copy embedding of the cube-connected-cycles network within the hypercube. This embedding is used to derive efficient multiple-path embeddings of trees and butterfly networks in hypercubes.

[1]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[2]  Arnold L. Rosenberg,et al.  Optimal embeddings of butterfly-like graphs in the hypercube , 1990, Mathematical systems theory.

[3]  Fred S. Annexstein,et al.  A unified framework for off-line permutation routing in parallel networks , 1991, Mathematical systems theory.

[4]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[5]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[6]  S. Lennart Johnsson,et al.  Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures , 1987, J. Parallel Distributed Comput..

[7]  E. Reingold,et al.  Combinatorial Algorithms: Theory and Practice , 1977 .

[8]  John A. Ellis.  Embedding Rectangular Grids into Square Grids , 1988, AWOC.

[9]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[10]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[11]  S. Johnsson,et al.  Spanning balanced trees in Boolean cubes , 1989 .

[12]  Mikhail J. Atallah,et al.  Optimal simulations between mesh-connected arrays of processors , 1988, JACM.

[13]  Bruce M. Maggs,et al.  Fast algorithms for bit-serial routing on a hypercube , 1990, SPAA '90.

[14]  Nicholas Pippenger,et al.  Parallel Communication with Limited Buffers (Preliminary Version) , 1984, FOCS.

[15]  Ivan Havel,et al.  Embedding the polytomic tree into the $n$-cube , 1973 .

[16]  M. Y. Chan,et al.  Embedding of d-dimensional grids into optimal hypercubes , 1989, SPAA '89.

[17]  Jean-Claude Bermond,et al.  Decomposition into Cycles I: Hamilton Decompositions , 1990 .

[18]  Arnold L. Rosenberg,et al.  Optimal simulations by Butterfly Networks , 1988, STOC '88.

[19]  Arnold L. Rosenberg,et al.  Universal Graphs for Bounded-Degree Trees and Planar Graphs , 1989, SIAM J. Discret. Math..

[20]  Arnold L. Rosenberg,et al.  Optimal simulations of tree machines , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[21]  John A. Ellis.  Embedding Rectangular Grids into Square Grids , 1991, IEEE Trans. Computers.

[22]  Frank Thomson Leighton,et al.  Coding theory, hypercube embeddings, and fault tolerance , 1991, SPAA '91.

[23]  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).

[24]  David S. Greenberg.  Full utilization of communication resources , 1992 .

[25]  Quentin F. Stout,et al.  Intensive Hypercube Communication. Prearranged Communication in Link-Bound Machines , 1990, J. Parallel Distributed Comput..

[26]  William J. Dally,et al.  A VLSI Architecture for Concurrent Data Structures , 1987 .

[27]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[28]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[29]  Abhiram G. Ranade,et al.  How to emulate shared memory (Preliminary Version) , 1987, FOCS.

[30]  Arnold L. Rosenberg,et al.  On Embedding Rectangular Grids in Square Grids , 1982, IEEE Transactions on Computers.

[31]  Fikret Erçal,et al.  Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures , 1997, J. Parallel Distributed Comput..