A Deadlock-Free Flow Control Policy Supporting Adaptive Routing in k-ary n-cube

摘要

A novel flow control policy is presented in this paper The policy is based on Bubble flow control, a mechanism that guarantees enough free buffer space in the network to allow continuous packet movement. It uses virtual cut-through switching and credit-based flow control mechanism and realizes the point-topoint flow control by analyzing the credit value of destination port and the routing information of the packets. Based on the flow control policy, an adaptive routing algorithm is designed for k-ary ncube with the benefits of deadlock-free and minimal distance. The result shows that the algorithm owns preferable performance, resulting in base latency values over 10% with respect to the corresponding policies.