Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
IEEE Transactions on Computers
Simulation of large networks on smaller networks
Information and Control
On mapping parallel algorithms into parallel architectures
Journal of Parallel and Distributed Computing
Optimal simulations between mesh-connected arrays of processors
Journal of the ACM (JACM)
The classification of coverings of processor networks
Journal of Parallel and Distributed Computing
Group action graphs and parallel architectures
SIAM Journal on Computing
Embedding large tree machines into small ones
Proceedings of the fifth MIT conference on Advanced research in VLSI
Simulating binary trees on X-trees (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Efficient embeddings of trees in hypercubes
SIAM Journal on Computing
Dynamic tree embeddings in butterflies and hypercubes
SIAM Journal on Computing
Taking random walks to grow trees in hypercubes
Journal of the ACM (JACM)
Optimal emulations by butterfly-like networks
Journal of the ACM (JACM)
Work-preserving emulations of fixed-connection networks
Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
An Intuitive and Effective New Representation for Interconnection Network Structures
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
| Hi-index | 0.00 |
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into 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. Using the new embedding strategy, we show that the CCC of dimension l can be embedded into the CCC of dimension k with dilation 1 and optimum load for any k, $l \in {\hbox{\sl{\rlap{N}\kern1.5pt{\hbox{N}}}}},$k驴 8, such ${\textstyle{5 \over 3}}+c_k