Fully symmetric swapped networks based on bipartite cluster connectivity

Authors:
Wenjun Xiao;Behrooz Parhami;Weidong Chen;Mingxin He;Wenhong Wei
Affiliations:
School of Software Engineering, South China University of Technology, Guangzhou 510641, PR China;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA;School of Software Engineering, South China University of Technology, Guangzhou 510641, PR China;School of Software Engineering, South China University of Technology, Guangzhou 510641, PR China;School of Software Engineering, South China University of Technology, Guangzhou 510641, PR China
Venue:
Information Processing Letters
Year:
2010

Citing 5
Cited 1

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Group action graphs and parallel architectures

SIAM Journal on Computing
Topological Properties of OTIS-Networks

IEEE Transactions on Parallel and Distributed Systems
Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel processors

ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
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

Multiswapped networks and their topological and algorithmic properties

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

The class of swapped or OTIS (optical transpose interconnect system) networks, built of n copies of an n-node cluster by connecting node i in cluster j to node j in cluster i for ij, has been studied extensively. One problem with such networks is that node i of cluster i has no intercluster link. This slight asymmetry complicates a number of algorithms and hinders both theoretical investigations and practical pursuits, such as building parallel node-disjoint paths for fault tolerance. We introduce biswapped networks that are fully symmetric and have cluster connectivity very similar to swapped/OTIS networks. We derive basic topological parameters, present a simple distributed shortest-path routing algorithm, and point to a number of other interesting properties under investigation for biswapped networks.