skip to main content
article

Fully symmetric swapped networks based on bipartite cluster connectivity

Published: 01 February 2010 Publication History

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 i<>j, 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.

References

[1]
Akers, S.B. and Krishnamurthy, B., A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput. v38. 555-566.
[2]
Annexstein, F., Baumslag, M. and Rosenberg, A.L., Group action graphs and parallel architectures. SIAM J. Comput. v19. 544-569.
[3]
Day, K. and Al-Ayyoub, A., Topological properties of OTIS-networks. IEEE Trans. Parallel Distrib. Systems. v13 i4. 359-366.
[4]
M. Heydemann, Cayley graphs and interconnection networks, in: Graph Symmetry: Algebraic Methods and Applications, 1997, pp. 167--224
[5]
Marsden, G., Marchand, P., Harvey, P. and Esener, S., Optical transpose interconnection system architectures. Opt. Lett. v18 i13. 1083-1085.
[6]
Parhami, B., Swapped interconnection networks: Topological, performance, and robustness attributes. J. Parallel Distrib. Comput. v65. 1443-1452.
[7]
Xiao, W.J. and Parhami, B., Some mathematical properties of Cayley digraphs with applications to interconnection network design. Int. J. Comput. Math. v82. 521-528.
[8]
C.-H. Yeh, B. Parhami, Swapped networks: Unifying the architectures and algorithms of a wide class of hierarchical parallel processors, in: Proc. International Conf. Parallel and Distributed Systems, June 1996, pp. 230--237

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Information Processing Letters
Information Processing Letters  Volume 110, Issue 6
February, 2010
39 pages

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 01 February 2010

Author Tags

  1. Bipartite graph
  2. Hierarchical network
  3. Interconnection network
  4. OTIS network
  5. Routing algorithm
  6. Swapped network
  7. Topological parameters

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media