Novel Routing Algorithm for Minimum on Delay with Process Variation and Congestion in Asynchronous NoC
Rabab Ezz-Eldin, Magdy Ali El-Moursy, Hesham F. A. Hamed · 2015
A novel routing algorithm is presented to avoid the impact of process variation and congestion for asynchronous NoC design. Process variation Delay and Congestion aware Routing (PDCR) is proposed as adaptive, low cost and scalable routing algorithm. The performance of PDCR with process variation is determined as compared with different routing algorithms under various traffic patterns. The saturation throughput and average message delay are used as performance metrics. PDCR outperforms different adaptive routing algorithms using various traffic patterns. PDCR can achieve up to 12% - 32% average message delay lower than that of other routing algorithms. Moreover, the proposed scheme yields improvements in saturation throughput by up to 11% - 82% compared with other adaptive routing algorithms.