高级检索
    肖灿文, 张民选, 过 锋. 环网中的维度气泡流控与自适应路由算法[J]. 计算机研究与发展, 2007, 44(9): 1510-1517.
    引用本文: 肖灿文, 张民选, 过 锋. 环网中的维度气泡流控与自适应路由算法[J]. 计算机研究与发展, 2007, 44(9): 1510-1517.
    Xiao Canwen, Zhang Minxuan, Guo Feng. Dimensional Bubble Flow Control and Adaptive Routing Algorithm in Torus Networks[J]. Journal of Computer Research and Development, 2007, 44(9): 1510-1517.
    Citation: Xiao Canwen, Zhang Minxuan, Guo Feng. Dimensional Bubble Flow Control and Adaptive Routing Algorithm in Torus Networks[J]. Journal of Computer Research and Development, 2007, 44(9): 1510-1517.

    环网中的维度气泡流控与自适应路由算法

    Dimensional Bubble Flow Control and Adaptive Routing Algorithm in Torus Networks

    • 摘要: 介绍了一个称为环网维度气泡流控(TDBFC)的新型流控策略和称为环网维度气泡路由(TADBR)算法的新型自适应路由算法.在Bubble流控和DBFC流控的基础上设计了适合于环网的维度气泡流控.在环网中,如果采用TDBFC流控策略,设计的TADBR自适应路由算法可实现无死锁的最短距离的路由.对于以上结论,提供了详细的证明.最后,介绍了自行设计的模拟工具RingNetSim,该模拟器实现了TDBFC流控策略和TADBR算法.在RingNetSim上分析了TADBR算法的性能,结果显示环网维度气泡路由算法拥有较好的性能.

       

      Abstract: One novel flow control strategy called torus' dimensional bubble flow control (TDBFC) is presented. At the same time, a novel adaptive routing algorithm called torus' dimensional bubble routing algorithm (TADBR) is also presented. The flow control strategy of TDBFC is designed for torus networks and based on bubble flow control and DBFC flow control. Since there are similar things between bubble flow control and DBFC flow control such as virtual cut-through switching and credit-based flow control mechanism etc, the flow control strategy of TDBFC is realized by integration of bubble and DBFC flow control. In torus networks, when the flow control strategy of TDBFC is accepted, the routing algorithm of TADBR can get the goals including deadlock-free and minimal distance even if the cyclic dependencies exist. The detailed proof is provided for these conclusions by analysis of the situation of all kinds of packet. Finally, the 2-D torus simulator called RingNetSim is presented. The simulator realizes the flow control of TDBFC and routing algorithm of TADBR. The performance of routing algorithms is evaluated by adjusting buffering space, communication models and arbitration algorithms. The performance results of TADBR algorithm are compared with the dimension-order routing algorithm. The results show that the TADBR algorithm owns preferable performance.

       

    /

    返回文章
    返回