A Non-Minimal Routing Algorithm for Aging Mitigation in 2D-Mesh NoCs
Publication in refereed journal


Times Cited
Altmetrics Information
.

Other information
AbstractDue to technology scaling, aging issue is becoming one of major concerns in the design of network-on-chip (NoC). The imbalanced workload distribution and routing algorithm cause aging hotspots, where a certain group of routers have higher aging effect than others. This can possibly lead to shorter lifetime of NoC. Most existing aging-aware routing algorithms are based on minimal routing, which suffers from less degree of adaptiveness compared to non-minimal routing. Thus, they are inefficient to mitigate the aging effect of routers. In this paper, we propose to use a non-minimal routing scheme to detour the traffic away from the aging hotspots, with the objective of mitigating the aging effect for NoCs. The problem is formulated as a bottleneck shortest path problem and solved using a dynamic programming approach. Finally, the experimental results show that compared to the state-of-the-art aging-aware routing algorithm, the non-minimal routing algorithm has up to 20% lifetime improvement for hotspot traffic patterns and realistic workload traces.
All Author(s) ListLiang Wang, Xiaohang Wang, Ho-Fung Leung, Terrence Mak
Journal nameIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year2019
Month7
Volume Number38
Issue Number7
PublisherIEEE
Pages1373 - 1377
ISSN0278-0070
eISSN1937-4151
LanguagesEnglish-United States

Last updated on 2020-10-08 at 00:34