IEEE Transactions on Parallel and Distributed Systems
Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks
IEEE Transactions on Parallel and Distributed Systems
The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks
Information Processing Letters
Swapped interconnection networks: Topological, performance, and robustness attributes
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
An oblivious shortest-path routing algorithm for fully connected cubic networks
Journal of Parallel and Distributed Computing
Fully symmetric swapped networks based on bipartite cluster connectivity
Information Processing Letters
The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks
Information Processing Letters
An efficient construction of node disjoint paths in OTIS networks
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
General biswapped networks and their topological properties
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Pancyclicity of OTIS (swapped) networks based on properties of the factor graph
Information Processing Letters
Some properties of WK-recursive and swapped networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
On pancyclicity properties of OTIS networks
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Multiswapped networks and their topological and algorithmic properties
Journal of Computer and System Sciences
Fault isolation and identification in general biswapped networks under the PMC diagnostic model
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we propose a new class of interconnection networks, called swapped networks, for general-purpose parallel processing. Swapped networks not only generate a wide class of high-performance interconnection networks, but also generalize, and serve to unify, many proposed parallel architectures as well as their algorithms. We show that swapped networks can efficiently emulate hypercubes, high-dimensional meshes, or generalized hypercubes, while having node degrees significantly smaller than the emulated network in each case. We also show that some subclasses of swapped networks can achieve asymptotically optimal diameters. Swapped networks are highly modularized, make the use of fixed-degree building blocks possible for any practically realizable system, and lead to the construction of high-performance scalable networks with reasonable cost.