Fault Tolerance in the Biswapped Network
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
Algorithms of Basic Communication Operation on the Biswapped Network
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
General biswapped networks and their topological properties
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
The Optical Chained-Cubic Tree interconnection network: Topological structure and properties
Computers and Electrical Engineering
Multiswapped networks and their topological and algorithmic properties
Journal of Computer and System Sciences
Hi-index | 0.00 |
In this paper, we propose a new class of interconnection networks, called "biswapped networks" (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simple rule for connectivity that ensures its regularity, modularity, fault tolerance, and algorithmic efficiency. In particular, if the basis network is a Cayley digraph then so is the resulting BSN. Our proposed networks provide a systematic construction strategy for large, scalable, modular, and robust parallel architectures, while maintaining many desirable attributes of the underlying basis network that comprises its clusters. We show how key parameters of a BSN are related to the corresponding parameters of its basis network and obtain a number of results on internode distances, Hamiltonian cycles, and node-disjoint paths. We also discuss the relationship between BSNs and swapped or OTIS networks.