K-ary N-cube网络中的维度气泡流控与无死锁完全自适应路由  

DBFC: Dimensional Bubble Flow Control with Deadlock-Free and Fully Adaptive Routing in the K-ary N-cube Network

作　　者：肖灿文[1] 张民选[1] 过锋[1] 

机构地区：[1]国防科学技术大学计算机学院,长沙410073

出　　处：《计算机学报》2006年第5期801-807,共7页Chinese Journal of Computers

基　　金：国家自然科学基金(90307001)资助.

摘　　要：利用虚跨步切换技术中消息的依存关系只与相邻缓冲区队列相关的特点,设计了一种称为维度气泡流控(DBFC)的新型流控策略.该流控策略建立在虚跨步(VCT)切换和信约流控机制之上,通过分析端口信约值和路由信息实现点点间的流控.在无边带karyncube网络中,如果采用DBFC流控策略,即使网络中存在环相关,设计的自适应维度气泡路由(ADBR)算法仍可实现无死锁的最短距离的路由.对于以上结论,文中提供了详细的证明.最后,通过修改模拟工具RSIM的网络模拟器———NETSIM的代码,实现了DBFC流控策略和ADBR算法.模拟结果显示,ADBR算法在性能上比常用的维序路由优越,在报文延迟上有近17.5%的降低.Focusing on the particular characteristics of virtual cut-through switching network, the authors find that message dependencies are localized between adjacent queues. Using this characteristic, the authors design the novel flow control strategy called dimensional bubble flow control （DBFC）. The flow control strategy of DBFC builds on virtual cut-through switching and credit-based flow control mechanism and analyzes the credit value of port and the routing informa- tion of the packets to realize the point-point flow control. In the k-ary n-cube network without wraparound connections, when the flow control strategy of DBFC is accepted, the adaptive dimensional bubble routing （ADBR） algorithm designed in this paper can get the goals including deadlock-free and minimal distance even if the cyclic dependencies exist. In this paper, the detail proof is provided for these conclusions. Lastly, the authors adapt the source code of NETSIM that is a simulator of network and realize the flow control of DBFC and ADBR algorithm in NETSIM. The authors adopt the actual application programs to test the performance of ADBR on RSIM. The simulation performance shows the preposed scheme is superior to the approach of usual dimension-order routing, with nearly 17.5% reduction in the packets latency.

关 键 词：基于信约的流控 死锁 无边带k-ary n-cube网络 虚跨步切换 

分 类 号：TP302[自动化与计算机技术—计算机系统结构]