Optimal simulations by Butterfly Networks
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Work-preserving emulations of fixed-connection networks
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Embedding mesh of trees in the hypercube
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Embedding of grids into optimal hypercubes
SIAM Journal on Computing
Product-shuffle networks: toward reconciling shuffles and butterflies
Discrete Applied Mathematics - Special double volume: interconnection networks
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
The Hyper-deBruijn Networks: Scalable Versatile Architecture
IEEE Transactions on Parallel and Distributed Systems
The Shuffle Exchange Network has a Hamiltonian Path
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
A complexity theory for VLSI
Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees
IEEE Transactions on Parallel and Distributed Systems
Efficient VLSI Layouts for Homogeneous Product Networks
IEEE Transactions on Computers
A Theory for Total Exchange in Multidimensional Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Recursive Cube of Rings: A New Topology for Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
Generalized Algorithm for Parallel Sorting on Product Networks
IEEE Transactions on Parallel and Distributed Systems
Cyclic Networks: A Family of Versatile Fixed-Degree Interconnection Architectures
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Changing the Diameter of Graph Products
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Multilayer VLSI Layout for Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model
IEEE Transactions on Computers
A generalized fault-tolerant sorting algorithm on a product network
Journal of Systems Architecture: the EUROMICRO Journal
The necklace-hypercube: a well scalable hypercube-based interconnection network for multiprocessors
Proceedings of the 2005 ACM symposium on Applied computing
Containment properties of product and power graphs
Discrete Applied Mathematics
A finite automata approach to modeling the cross product of interconnection networks
Mathematical and Computer Modelling: An International Journal
Bisection (band)width of product networks with application to data centers
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 0.02 |
This paper first analyzes some general properties of product networks pertinent to parallel architectures and then focuses on three case studies. These are products of complete binary trees, shuffle-exchange, and de Bruijn networks. It is shown that all of these are powerful architectures for parallel computation, as evidenced by their ability to efficiently emulate numerous other architectures. In particular, r-dimensional grids, and r-dimensional meshes of trees can be embedded efficiently in products of these graphs, i.e. either as a subgraph or with small constant dilation and congestion. In addition, the shuffle-exchange network can be embedded in r-dimensional product of shuffle exchange networks with dilation cost 2r and congestion cost 2. Similarly, the de Bruijn network can be embedded in r-dimensional product of de Bruijn networks with dilation cost r and congestion cost 4. Moreover, it is well known that shuffle-exchange and de Bruijn graphs can emulate the hypercube with a small constant slowdown for 驴normal驴 algorithms. This means that their product versions can also emulate these hypercube algorithms with constant slowdown. Conclusions include a discussion of many open research areas.