The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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.</p><p>We propose a new class of parallel architectures, called the <it>mesh-connected trees</it> (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.</p><p>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.</p>
Parallel architectures, interconnection networks, parallel algorithms, product networks, graph embedding, binary tree, grids, hypercubes, mesh of trees.

K. Efe and A. Fernández, "Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 1281-1291, 1996.
86 ms
(Ver 3.3 (11022016))