Download:
|
by Ralf Klasing, Reinhard Luling, Burkhard Monien
Proc. 2nd IEEE Symposium on Parallel and Distributed Processing
http://www.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/CompressCCC_TechRep.ps.Z
Add To MetaCart
Abstract:
We consider the simulation of large cube-connected cycles (CCC) and 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. We show that large CCC's and BFN 's 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. Our results show that large CCC's and BFN 's can be simulated very efficiently on smaller ones. Additionally, we implemented our algorithm for compressing CCC's and ran several experiments on a Transputer network, which showed that our technique also behaves very well from a practical point of view.
Citations
|
202
|
How toEmulate Shared Memory
– Ranade
- 1991
|
|
173
|
The cube connected cycles: A versatile network for parallel computation
– Preparata, Vuillemin
- 1979
|
|
132
|
Parallel processing with the perfect shuffle
– Stone
- 1971
|
|
48
|
Embedding one Interconnection Network in another
– Monien, Sudborough
- 1990
|
|
31
|
On mapping parallel algorithms into parallel architectures
– Berman, Snyder
- 1984
|
|
28
|
Optimal simulation between mesh-connected arrays of processors
– Kosaraju, Atalah
|
|
23
|
Optimal simulations by butterfly networks
– Bhatt, Chung, et al.
- 1988
|
|
22
|
Ultracomputers
– Schwartz
- 1980
|
|
21
|
Two strategies for solving the vertex cover problem on a transputer network
– Luling, Monien
- 1989
|
|
19
|
The classification of coverings of processor networks
– Bodlaender
- 1989
|
|
18
|
Quotient networks
– Fishburn, Finkel
- 1982
|
|
13
|
Graph embeddings 1988: recent breakthroughs, new directions
– Rosenberg
- 1988
|
|
11
|
Encoding Graphs in Graphs
– Fellows
- 1985
|
|
10
|
Simulating Binary Trees on X-trees
– Monien
- 1991
|
|
8
|
Embedding large tree machines into small ones
– Gupta, Hambrusch
- 1988
|
|
3
|
The Cube-Connected-Cycle is a subgraph of the Butterfly network
– Feldmann, Unger
- 1992
|
|
3
|
Programming solutions to the algorithm contraction problem
– Nelson, Snyder
- 1986
|
|
2
|
Leeuwen, "Simulation of large networks on smaller networks
– Bodlaender, van
- 1986
|
|
2
|
Compressing meshes into small hypercubes
– Ellis, Miller, et al.
|
|
2
|
Simulating large cube-connected cycles and large butterfly networks on smaller ones
– Klasing
|
|
2
|
Cayley-Graphen und Netzwerke", Master Thesis
– Peine
- 1990
|
