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
Product-shuffle networks: toward reconciling shuffles and butterflies
Discrete Applied Mathematics - Special double volume: interconnection networks
Homogeneous product networks for processor interconnection
Homogeneous product networks for processor interconnection
Optimal emulations by butterfly-like networks
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Products of Networks with Logarithmic Diameter and Fixed Degree
IEEE Transactions on Parallel and Distributed Systems
Optimal Embedding of Complete Binary Trees into Lines and Grids
WG '91 Proceedings of the 17th International Workshop
A complexity theory for VLSI
Computational Aspects of VLSI
Efficient VLSI Layouts for Homogeneous Product Networks
IEEE Transactions on Computers
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
Multi-mesh of trees with its parallel algorithms
Journal of Systems Architecture: the EUROMICRO Journal
A generalized fault-tolerant sorting algorithm on a product network
Journal of Systems Architecture: the EUROMICRO Journal
Containment properties of product and power graphs
Discrete Applied Mathematics
OTIS-MOT: an efficient interconnection network for parallel processing
The Journal of Supercomputing
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.01 |
The grid and the mesh of trees (or MOT) are among the best-known parallel architectures in the literature. Both of them enjoy efficient VLSI layouts, simplicity of topology, and a large number of parallel algorithms that can efficiently execute on them. One drawback of these architectures is that algorithms that perform best on one of them do not perform very well on the other. Thus there is a gap between the algorithmic capabilities of these two architectures.We propose a new class of parallel architectures, called the mesh-connected trees (or MCT) that can execute grid algorithms as efficiently as the grid, and MOT algorithms as efficiently as the MOT, up to a constant amount of slowdown. In particular, the MCT topology contains the MOT as a subgraph and emulates the grid via embedding with dilation 3 and congestion two. This significant amount of computational versatility offered by the MCT comes at no additional VLSI area cost over these earlier networks. Many topological, routing, and embedding properties analyzed here suggests that the MCT architecture is also a serious competitor for the hypercube. In fact, while the MCT is much simpler and cheaper than the hypercube, for all the algorithms we developed, the running time complexity on the MCT matches those of well known hypercube algorithms.We also present an interesting variant of the MCT architecture that admits both the MOT and the torus as its subgraphs. While most of the discussion in this paper is focused on the MCT architecture itself, these analyses can be easily extended to the variant of the MCT presented here.