The connection machine
Strategies for interconnection networks: some methods from graph theory
Journal of Parallel and Distributed Computing
Massively parallel computing with the DAP
Massively parallel computing with the DAP
Dynamic routing for regular direct computer networks
Dynamic routing for regular direct computer networks
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Dense, symmetric interconnection networks
Dense, symmetric interconnection networks
Vertex-transitivity and routing for Cayley graphs in GCR representations
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Highly parallel computing
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Doing the Twist: Diagonal Meshes Are Isomorphic to Twisted Toroidal Meshes
IEEE Transactions on Computers
Performance modeling of multihop network subject to uniform and nonuniform geometric traffic
IEEE/ACM Transactions on Networking (TON)
Changing the Diameter of Graph Products
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Information Processing Letters
L(2, 1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Characterizing r-perfect codes in direct products of two and three cycles
Information Processing Letters
An Upper Bound for the Bisection Width of a Diagonal Mesh
IEEE Transactions on Computers
The new torus network design based On 3-dimensional hypercube
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
L(2,1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Characterizing r-perfect codes in direct products of two and three cycles
Information Processing Letters
Two-node-Hamiltonicity of enhanced pyramid networks
Information Sciences: an International Journal
A first approach to king topologies for on-chip networks
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
Journal of Parallel and Distributed Computing
Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers
The Journal of Supercomputing
Expanded Borel Cayley Graphs (Ex-BCGs): A novel communication topology for multi-agent systems
Journal of Network and Computer Applications
| Hi-index | 14.99 |
Diagonal and toroidal mesh are degree-4 point to point interconnection models suitable for connecting communication elements in parallel computers, particularly multicomputers. The two networks have a similar structure. The toroidal mesh is popular and well-studied whereas the diagonal mesh is relatively new. In this paper, we show that the diagonal mesh has a smaller diameter and a larger bisection width. It also retains advantages such as a simple rectangular structure, wirability and scalability of the toroidal mesh network. An optimal self-routing algorithm is developed for these networks. Using this algorithm and the existing routing algorithm for the toroidal mesh, we simulated and compare the performance of these two networks with N=35/spl times/71=2485, N=49/spl times/99=4851, and N=69/spl times/139=9591 nodes under a constant system with a fixed number of messages. Deflection routing is used to resolve conflicts. The effects of various deflection criteria are also investigated. We show that the diagonal mesh outperforms the toroidal mesh in all cases, and thus provides an attractive alternative to the toroidal mesh network.