TY - GEN
T1 - Low-cost congestion detection mechanism for networks-on-chip
AU - Han, Zhengqian
AU - Meyer, Michael Conrad
AU - Jiang, Xin
AU - Watanabe, Takahiro
N1 - Funding Information:
ACKNOWLEDGMENT This work was partly supported by JSPS KAKENHI Grant Number 18K11226.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/10
Y1 - 2019/10
N2 - Congestion detection has become a hot issue in Networks-on-Chip. Congestion-Aware routing algorithms are designed to avoid congestion in the network; however, most of them achieve small performance benefits while drastically increasing the cost if the mesh size becomes larger. Using a different approach, we utilize the network itself to detect the congestion. In this paper, a congestion detecting mechanism is proposed, which is capable of locating where the congestion is in the network within several cycles. Then, the mechanism is applied to routing algorithm selection and task scheduling. The most suitable routing algorithm is selected according to the detection result. If the congestion status changes, the mechanism can also detect the change and judge whether the routing algorithm needs to be changed. Moreover, from the detection result, we can know the effect of task scheduling and judge whether it needs to be changed. Experimental results show that with the proposed detecting mechanism, the suitable routing algorithm is able to be successfully selected according to the congestion status and the better choice of task scheduling can be made. Consequently, the performance of NoC with the proposed congestion detection mechanism increases.
AB - Congestion detection has become a hot issue in Networks-on-Chip. Congestion-Aware routing algorithms are designed to avoid congestion in the network; however, most of them achieve small performance benefits while drastically increasing the cost if the mesh size becomes larger. Using a different approach, we utilize the network itself to detect the congestion. In this paper, a congestion detecting mechanism is proposed, which is capable of locating where the congestion is in the network within several cycles. Then, the mechanism is applied to routing algorithm selection and task scheduling. The most suitable routing algorithm is selected according to the detection result. If the congestion status changes, the mechanism can also detect the change and judge whether the routing algorithm needs to be changed. Moreover, from the detection result, we can know the effect of task scheduling and judge whether it needs to be changed. Experimental results show that with the proposed detecting mechanism, the suitable routing algorithm is able to be successfully selected according to the congestion status and the better choice of task scheduling can be made. Consequently, the performance of NoC with the proposed congestion detection mechanism increases.
KW - Congestion detection
KW - Low-cost
KW - Network on Chip
KW - Performance analysis
UR - http://www.scopus.com/inward/record.url?scp=85076128549&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85076128549&partnerID=8YFLogxK
U2 - 10.1109/MCSoC.2019.00030
DO - 10.1109/MCSoC.2019.00030
M3 - Conference contribution
AN - SCOPUS:85076128549
T3 - Proceedings - 2019 IEEE 13th International Symposium on Embedded Multicore/Many-Core Systems-on-Chip, MCSoC 2019
SP - 157
EP - 163
BT - Proceedings - 2019 IEEE 13th International Symposium on Embedded Multicore/Many-Core Systems-on-Chip, MCSoC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 13th IEEE International Symposium on Embedded Multicore/Many-Core Systems-on-Chip, MCSoC 2019
Y2 - 1 October 2019 through 4 October 2019
ER -