1 Novel Flow Control for Fully Adaptive Routing in Cache-coherent NoCs

Abstract—This paper contains the supplementary material to the paper submitted to IEEE TPDS entitled “Novel Flow Control for Fully Adaptive Routing in Cache-coherent NoCs ” (labeled as “main file ” in this paper). In Sec. 1, we prove that if a routing algorithm with WPF is deadlock-free, then this algorithm with conservative VC re-allocation is also deadlock-free. In Sec. 2, we provide further insights for the performance trends of routing algorithms by analyzing the buffer utilization. In Sec. 3, we present the full system performance analysis. In Sec. 4, we show the recursive algorithm to calculate the allowable escape VC. In Sec. 5, we perform sensitivity study on several configuration parameters. In Sec. 6, we provide further discussion about the designs