期刊文献+

Biswapped网络(BSN)的拓扑性质研究:点对称性和极大容错性 被引量:3

Topological Properties of Biswapped Networks(BSNs):Node Symmetry and Maximal Fault Tolerance
下载PDF
导出
摘要 Biswapped网络(BSN)是一类两层结构的互连网络,它以任意图为模块且模块间采用一种完全两部图方式互连.BSN的互连形式与OTIS网络(即Swapped网络)类似但互连规则更一致,使得BSN展现出更好的性能.文中主要研究BSN的点传递性和容错性能.首先证明BSN能继承因子网络的点传递性质,为BSN上的分析和算法简单性找到理论依据.其次,通过直接构造网络中两点间最大数目的点不相交路径证明以任意连通图为因子网络的BSN是一致极大容错的.这些结果表明BSN既能继承因子网络的理想性能还展现某些好的新特性.最后,通过与OTIS网络、卡式积网络等层次类网络比较表明,BSN提供了一种构建可扩展性、模块化、容错性的大规模并行计算机系统的潜在有竞争力的体系结构形式. Recent Niswapped Networks (BSNs) are a class of two-level structure interconnection networks taking any graph as modules and connecting them in a complete bipartite manner. A simple rule for connectivity in BSNs, similar to but more uniform than the one in well-known OTIS networks or swapped networks, leads to better performances in BSNs. In this paper, the node symmetry and the fault tolerance of BSNs are investigated. It is showen that if a factor network is node transitive then so is the resulting BSN, which gives a justification for simplicities in analyses and algorithms in BSNs. Moreover, by giving a simple general construction of a maximal number of node-disjoint paths between nodes in a BSN built of a connected graph, it is proven the BSN possesses uniformly maximal fault tolerance property regardless of whether the factor network is maximally fault tolerant or not. In contrast with OTIS networks and Cartesian product networks, these results further confirm that the connectivity rule in BSNs provides a systematic competitive construction scheme for large, scalable, modular, and robust parallel architectures, while maintaining favorable properties of their factor networks.
出处 《计算机学报》 EI CSCD 北大核心 2010年第5期822-832,共11页 Chinese Journal of Computers
基金 广东省自然科学基金(04020130) 国家自然科学基金(60973150)~~
关键词 互连网络 OTIS网络 Biswapped网络 拓扑性质 点传递性 极大容错性 interconnection network OTIS network Biswapped network topological property node transitivity maximal fault tolerance
  • 相关文献

参考文献20

  • 1Marsden G C,Marchand P J,Harvey P,Esener S C.Optical transpose interconnection system architectures.Optical Letters,1993,18(13):1083-1085.
  • 2Yeh C H,Parhami B.Swapped networks:Unifying the architectures and algorithms of a wide class of hierarchical parallel processOrs/VProceedings of the 1996 International Conference on Parallel and Distributed Systems.Tokyo Japan.Los Alamitos,California:IEEE Computer Society Press,1996:230-237.
  • 3Parhami B.Swapped interconnection networks:Topological,performance,and robustness attributes.Journal of Paralleland Distributed Computing,2005,65(11):1443-1452.
  • 4Wang C F,Sahni S.Matrix multiplication on the OTIS-Mesh optoelectronic computer.IEEE Transactions on Computers,2001,50(7):635-646.
  • 5Day K,Al-Ayyoub A E.Topological properties of OTIS-networks.IEEE Transactions on Parallel and Distributed Systems,2002,13(4):359-366.
  • 6Chen Weidong,Xiao Wenjun,Parhami Behrooz.Swapped (OTIS) networks built of connected basis networks are maximally fault tolerant.IEEE Transactions on Parallel and Distributed Systems,2009,20(3):361-366.
  • 7Zhao Chenggui,Xiao Wenjun,Parhami B.Load-balancing on swapped or OTIS networks.Journal of Parallel and Distributed Computing,2009,69(4):389-399.
  • 8Xiao Wenjun,Chen Weidong,He Mingxin,Wei Wenhong,Parhami B.Biswapped networks and their topological proper-ties//Proceedings of the 8th ACIS International Conference on Software Engineering,Artificial Intelligence,Networking and Parallel/Distributed Computing,Qingdao,China,2007.Los Alamitos,California:IEEE Computer Society Press,2007:193-198.
  • 9Xiao Wenjun,Parhami B,Chen Weidong,He Mingxin,Wei Wenhong.Fully symmetric swapped networks based on bipartite cluster connectivity.Information Processing Letters,2010,110(6):211-215.
  • 10Akers S B,Krishnamurthy B.A group-theoretic model for symmetric interconnection networks.IEEE Transactions on Computers,1989,38(4):555-566.

二级参考文献28

  • 1[1]Ortiz Z, Rouskas GN, Perros HG. Maximizing multicast throughput in WDM networks with tuning latencies using the virtual receiver concept. European Transactions on Telecommunications, 2000,11(1):63~72.
  • 2[2]Qiao CM, Mei YS. Off-Line permutation embedding and scheduling in multiplexed optical networks with regular topologies. IEEE/ACM Transactions on Networking, 1999,7(2):241~250.
  • 3[3]Yuan X, Melhem R. Optimal routing and channel assignments for hypercube communication on optical mesh-like processor arrays. In: Johnsson SL, ed. Proceedings of the 5th International Conference on Massively Parallel Processing Using Optical Interconnection. Las Vegas, NV: IEEE Press, 1998. 110~118.
  • 4[4]Yuan X, Melhem R, Gupta R. Distributed path reservation algorithm for multiplexed all-optical interconnection networks. IEEE Transactions on Computer, 1999,48(12):1355~1363.
  • 5[5]Yuan X, Melhem R, Gupa R. Performance of multi-hop communications using logical topologies on optical Torus networks. Journal of Parallel and Distributed Computing, 2001,61(6):748~766.
  • 6[6]Liu FA, Liu ZY, Qiao XZ. A practical interconnection network RP(k) and its routing algorithms. Science in China (Series F), 2001,44(6):461~473.
  • 7[7]Shen XJ, Liang WF, Hu Q. On embedding between 2D meshes of the same size. IEEE Transactions on Computer, 1997,46(8): 880~889.
  • 8Wu J,IEEE on Computers,1997年,46卷,2期,241页
  • 9Chiu G M,IEEE Trans Computers,1997年,46卷,8期,953页
  • 10Chiu G M,IEEE Trans Computers,1996年,45卷,2期,143页

共引文献50

同被引文献33

  • 1Cybenko George. Dynamic load balancing for dislributed mem- ory multiprocessors ~ J ]. Journal of Parallel and Distributed Computing, 1989,7(2) :279 - 301.
  • 2Muthukrishnan S, Ghosh Bhaskar, Schultz Martin H. First and second order diffusive methods for rapid, coarse, distributed load balancing[ A ]. Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, 1996 [ C]. USA: Springer- Verlag, 1996.
  • 3Ralf Diekmann, Andreas Frommer, Burkhard Monien. Efficient schemes for nearest neighbor load balancing[ J ]. Parallel Com- puting, 1999,25(7) :789 - 812.
  • 4Robert Elsasser, Andreas Frommer, Burkhard Monien, et al. Optimal and alternating-direction load balancing schemes[ A]. Proceedings of Euro-Par' 99, 1999 [ C ]. Berlin: Springer-Ver-lag, 1999.
  • 5Robert Elsasser, Burkhard Monien, Robert Preis. Diffusive load balancing schemes on heterogeneous networks[ A]. Proceedings of twelfth ACM Symposium on Parallel Algorithms and Archi- tectures, 2000 [ C ]. New Y ork: ACM, 2000.
  • 6Rotaru Tiberiu, Negeli Hans-Heinrich. Dynamic load balancing by diffusion in heterogeneous systems [ J ]. Journal of Parallel and Distributed Computing, 2004,64(4) :481 - 97.
  • 7Parhami Behrooz. Swapped interconnection networks: Topo- logical, performance, and robusmess attributes [ J ]. Journal of Parallel and DistribulM Computing, 2005, 65 ( 11 ) : 1443 - 1452.
  • 8Chen Wei-dong, Xiao Wen-jun, Parhami Behrooz. Swapped (OTIS)networks built of connected basis networks are maxi- mally fault tolerant [ J ]. IEF~ Transactions on Parallel and Distributed Systems, 2009,20(3) :361 - 366.
  • 9Xiao Wen-jun, Chen Wei-dong, He Ming-xin, et al. Biswapped networks and their topological properties [ A ].Proceedings of Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing,2007[ C]. Qingdao: Inst of Elec and Elec Eng Computer Society,2007.
  • 10Arndt, H. Load balancing: dimension exchange on product graphs[ A ]. Proceedings of eighteenth International Parallel and Distributed Processing Symposium,2004[ C]. Los Alami- tos: IEEE Comput Soc, 2004.

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部