Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks

References

• Akers , S. B. and Krishnamurthy , B. 1989 . A group theoretic model for symmetric interconnection networks . IEEE Trans. Comput. , 38 : 555 – 566 .
   Web of Science ®Google Scholar
• Annexstein , F. , Baumslag , M. and Rosenberg , A. L. 1990 . Group action graphs and parallel architectures . SIAM J. Comput. , 19 : 544 – 569 .
   Web of Science ®Google Scholar
• Biggs , N. 1993 . Algebraic Graph Theory , New York : Cambridge University Press .
   Google Scholar
• Boppana , R. V. , Chalasani , S. and Raghavendra , C. S. 1998 . Resource deadlocks and performance of wormhole multicast routing algorithms . IEEE Trans. Parallel Distrib. Syst , 9 ( 6 ) : 535 – 549 .
   Google Scholar
• Day , K. and Al-Ayyoub , A. 2002 . Topological properties of OTIS-networks . IEEE Trans. Parallel Distrib. Syst , 13 ( 4 ) : 359 – 366 .
   Google Scholar
• Heydemann , M. 1997 . “ Cayley graphs and interconnection networks ” . In Graph Symmetry: Algebraic Methods and Applications , Edited by: Hahn , G. and Sabidussi , G. 167 – 224 . San Mateo, California : Morgan Kaufmann .
   Google Scholar
• Leighton , F. T. 1992 . Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , San Mateo, California : Morgan Kaufmann .
   Google Scholar
• Marsden , G. , Marchand , P. , Harvey , P. and Esener , S. 1993 . Optical transpose interconnection system architectures . Opt. Lett , 18 ( 13 ) : 1083 – 1085 .
   PubMedGoogle Scholar
• Nocetti , F. G. , Stojmenovic , I. and Zhang , J. 2002 . Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks . IEEE Trans. Parallel Distrib. Syst. , 13 : 963 – 971 .
   Web of Science ®Google Scholar
• Parhami , B. 1999 . Introduction to Parallel Processing: Algorithms and Architectures , New York : Plenum .
   Google Scholar
• Parhami , B. 2005 . Swapped interconnection networks: Topological, performance, and robustness attributes . J. Parallel Distrib. Comput. , 65 : 1443 – 1452 .
   Google Scholar
• Parhami , B. and Kwai , D. M. 2001 . A unified formulation of honeycomb and diamond networks . IEEE Trans. Parallel Distrib. Syst. , 12 : 74 – 80 .
   Web of Science ®Google Scholar
• Stojmenovic , I. 1997 . Honeycomb networks: Topological properties and communication algorithms . IEEE Trans. Parallel Distrib. Syst. , 8 : 1036 – 1042 .
   Web of Science ®Google Scholar
• Xiao , W. J. and Parhami , B. 2005 . Some mathematical properties of Cayley digraphs with applications to interconnection network design . Int. J. Comput. Math. , 82 : 521 – 528 .
   Web of Science ®Google Scholar
• Xiao , W. J. and Parhami , B. 2007 . Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes . Discrete Appl. Math , 155 ( 13 ) : 1752 – 1760 .
   Google Scholar
• Xiao , W. J. , Chen , W. , He , M. , Wei , W. and Parhami , B. 2007 . Biswapped Networks and Their Topological Properties . Proceedings of the 8th International Conference Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing . July 2007 , Qingdao, China. Vol. 2 , pp. 193 – 198 .
   Google Scholar
• Xiao , W. J. , Parhami , B. , Chen , W. D. , He , M. X. and Wei , W. H. 2010 . Fully symmetric swapped networks based on bipartite cluster connectivity . Inf. Process. Lett , 110 ( 6 ) : 211 – 215 .
   Google Scholar
• Yeh , C.-H. and Parhami , B. 1996 . Swapped networks: Unifying the architectures and algorithms of a wide class of hierarchical parallel processors . Proc. Int. Conf. Parallel Distrib. Syst. , : 230 – 237 .
   Google Scholar