TY - GEN
T1 - Dynamic programming-based lifetime reliability optimization in networks-on-chip
AU - Wang, Liang
AU - Wang, Xiaohang
AU - Mak, Terrence
N1 - Publisher Copyright:
© IFIP International Federation for Information Processing 2015.
PY - 2015
Y1 - 2015
N2 - Technology scaling leads to the reliability issue as a primary concern in Networks-on-Chip (NoC) design. Due to routing algorithms, some routers may age much faster than others, which become a bottleneck for system lifetime. In this chapter, lifetime is modeled as a resource consumed over time. A metric lifetime budget is associated with each router, indicating the maximum allowed workload for current period. Since the heterogeneity in router lifetime reliability has strong correlation with the routing algorithm, we define a problem to optimize the lifetime by routing packets along the path with maximum lifetime budgets. A dynamic programming-based lifetime-aware routing algorithm is proposed to optimize the lifetime distribution of routers. The dynamic programming network approach is employed to solve this problem with linear complexity. The experimental results show that the lifetime-aware routing has around 20%, 45%, 55% minimal MTTF improvement than XY routing, NoP routing, and Oddeven routing, respectively.
AB - Technology scaling leads to the reliability issue as a primary concern in Networks-on-Chip (NoC) design. Due to routing algorithms, some routers may age much faster than others, which become a bottleneck for system lifetime. In this chapter, lifetime is modeled as a resource consumed over time. A metric lifetime budget is associated with each router, indicating the maximum allowed workload for current period. Since the heterogeneity in router lifetime reliability has strong correlation with the routing algorithm, we define a problem to optimize the lifetime by routing packets along the path with maximum lifetime budgets. A dynamic programming-based lifetime-aware routing algorithm is proposed to optimize the lifetime distribution of routers. The dynamic programming network approach is employed to solve this problem with linear complexity. The experimental results show that the lifetime-aware routing has around 20%, 45%, 55% minimal MTTF improvement than XY routing, NoP routing, and Oddeven routing, respectively.
KW - Dynamic programming
KW - Networks-on-Chip
KW - Reliability
KW - Routing algorithm
UR - https://www.scopus.com/pages/publications/84945962686
U2 - 10.1007/978-3-319-25279-7_1
DO - 10.1007/978-3-319-25279-7_1
M3 - 会议稿件
AN - SCOPUS:84945962686
SN - 9783319252780
T3 - IFIP Advances in Information and Communication Technology
SP - 1
EP - 20
BT - VLSI-SoC
A2 - Sanz-Pascual, Maria-Teresa
A2 - Sarmiento-Reyes, Arturo
A2 - Claesen, Luc
A2 - Reis, Ricardo
PB - Springer New York LLC
T2 - 22nd IFIP WG 10.5/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2014
Y2 - 6 October 2014 through 8 October 2014
ER -