Communications of the ACM - Special section on computer architecture
Permutations on Illiac IV-Type Networks
IEEE Transactions on Computers
An optimization problem in distributed loop computer networks
Proceedings of the third international conference on Combinatorial mathematics
An optimal routing algorithm for mesh-connected Parallel computers
Journal of the ACM (JACM)
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Optimal Distance Networks of Low Degree for Parallel Computers
IEEE Transactions on Computers
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
IEEE Transactions on Computers
Dense Gaussian networks: suitable topologies for on-chip multiprocessors
International Journal of Parallel Programming
| Hi-index | 0.02 |
A class of mesh networks with wrap-around links is obtained from a class of circulant graphs by means of a graph isomorphism. We demonstrate how to obtain, from the adjacency pattern of the graph, simple parameters that serve to construct a planar design of the network. Several performance parameters are evaluated: in particular, we show that diameter and average distance are simultaneously minimized. This implies a minimization of the network communication delays. Due to its easy implementation and good behavior characteristics, the proposed interconnection scheme is appropriate in several architectural environments. Specifically, this topology is suitable as an interconnection subsystem for message passing MIMD architectures, as well as for SIMD machines with a static interconnection scheme. In the particular case of SIMD machines, a comparison is made with the ILLIAC IV-type networks. As a consequence, we propose still another topology, when the number of processing elements is an even power of 2; for this solution, we show that a reduction in the network distances is achieved, without losing speed in performing arbitrary permutations.