摘要
Adaptive routing designing for network-on-chip architecture is complicated to guarantee deadlock-free. In this paper, we present methodology to design efficient multi-path routing algorithms for specific application wormhole network-on-chip system to guarantee deadlock-free. The methodology presents an analytical model for overall average delay of wormhole network-on-chip by queueing theory and uses a linear programming-based methodology to minimize overall average delay. The methodology guarantees deadlock freedom by efficient branch-and-bound algorithm. Compared to other adaptive deadlock-free algorithms, results obtained through simulation show that the algorithms can potentially achieve better throughput and latency.