Compressing cube-connected cycles and butterfly networks

The authors consider the simulation of large cube-connected cycles (CCC) large butterfly networks (BFN) on smaller ones, a problem that arises when algorithms designed for an architecture of an ideal size are to be executed on an existing architecture of a fixed size. The authors show that large CCCs and BFNs can be embedded into smaller networks of the same type with (a) dilation 2 and optimum load, (b) dilation 1 and optimum load in most cases, (c) dilation 1 and nearly optimum load in all cases. The results show that large CCCs and BFNs can be simulated very efficiently on smaller ones. Additionally, they implemented their algorithm for compressing CCCs and ran several experiments on a Transputer network, which showed that the technique also behaves very well from a practical point of view.<<ETX>>

[1]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[2]  Francine Berman,et al.  On Mapping Parallel Algorithms into Parallel Architectures , 1987, J. Parallel Distributed Comput..

[3]  Burkhard Monien,et al.  Embedding one interconnection network in another , 1990 .

[4]  Mikhail J. Atallah,et al.  Optimal simulations between mesh-connected arrays of processors , 1986, STOC '86.

[5]  Ivan Hal Sudborough,et al.  Comparing Interconnection Networks , 1988, MFCS.

[6]  Burkhard Monien.  Simulating binary trees on X-trees (extended abstract) , 1991, SPAA '91.

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

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

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

[10]  Arnold L. Rosenberg.  GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions , 1988, AWOC.

[11]  L. Snyder,et al.  Programming solutions to the algorithm contraction problem. Technical report , 1986 .

[12]  Hans L. Bodlaender,et al.  The Classification of Coverings of Processor Networks , 1989, J. Parallel Distributed Comput..

[13]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[14]  Susanne E. Hambrusch,et al.  Embedding large tree machines into small ones , 1988 .

[15]  John P. Fishburn,et al.  Quotient Networks , 1982, IEEE Transactions on Computers.

[16]  Jan van Leeuwen,et al.  Simulation of Large Networks on Smaller Networks , 1986, Inf. Control..

[17]  Reinhard Lüling,et al.  Two Strategies for Solving the Vertex Cover Problem on a Transputer Network , 1989, WDAG.

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

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