具有自适应性的star网络容错寻径策略研究  

Study on fault-tolerance seeking paths strategy with adaptivity in star networks

作　　者：花仁杰[1] 梁家荣[1] 翁毅[1] 

机构地区：[1]广西大学计算机与电子信息学院,南宁530004

出　　处：《计算机工程与应用》2011年第4期105-108,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60564001);国家教育部新世纪人才支持计划(No.NCEF-06-0756);广西大学研究生科研创新项目(No.2009105930903085)~~

摘　　要：大规模并行处理机系统中寻径算法对互连网络的通信性能和系统性能起着至关重要的作用,而star互连网络作为超立方体网络的最好替代之一,其寻径问题的解决变得非常重要。在有条件的容错模型基础上,对寻径时的规则进行了研究,提出了一种基于自适应规则的容错寻径算法。对算法的正确性以及容错性进行了分析。经仿真实验证明了该算法具有较高的成功概率。在边失效独立的情况下,对star网络终端对间通信可靠性进行了分析,推导出了其约束下界,并给予了证明。Seeking paths algorithm constitutes the primary factor influencing the communication performance of interconnection networks and the performance of massive parallel processors systems,so solutions for seeking paths problems of star network as one of the best alternatives to hypercube become very important.Under the conditional fault tolerant model,rules used for seeking paths are researched,and a fault-tolerance seeking paths algorithm based on adaptive rules is proposed.The correctness and the fault tolerance are analyzed.The simulation experiment confirms that the algorithm has very high success probability.Under the situation of edge failing independently,the communication reliability between two terminals in star networks is analyzed,and its lower bound limited is derived and confirmed.

关 键 词：star互连网络 自适应 容错寻径算法 容错性概率 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]