Please use this identifier to cite or link to this item: http://dlib.scu.ac.ir/handle/Hannan/174532
Title: Adaptive Routing Algorithms for Lifetime Reliability Optimization in Network-on-Chip
Authors: Liang Wang;Xiaohang Wang;Terrence Mak
subject: dynamic programming|Routing algorithm|network-on-chip|lifetime reliability
Year: 2016
Publisher: IEEE
Abstract: Technology scaling leads to the reliability issue as a primary concern in Network-on-Chip (NoC) design. We observe that due to routing algorithm some routers age much faster than others which becomes a bottleneck for NoC lifetime. In this paper, 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. The problem is then extended for both performance and lifetime reliability optimization. The lifetime is optimized in long-term time scale while performance is optimized in short-term time scale. Two dynamic programming-based adaptive routing algorithms (lifetime aware routing and multi-objective routing) are proposed to solve the problems. In the experiments, the lifetime aware routing and multi-objective routing algorithms are evaluated with synthetic traffic and real benchmarks respectively. The experimental results show that the lifetime aware routing has around 20, 45 and 55 percent minimal lifetime improvement than XY routing, NoP routing and Oddeven routing, respectively. In addition, the multi-objective adaptive routing algorithm can effectively improve both performance and lifetime.
Description: 
URI: http://localhost/handle/Hannan/174532
ISSN: 0018-9340
volume: 65
issue: 9
More Information: 2896
2902
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7349176.pdf419.19 kBAdobe PDFThumbnail
Preview File
Title: Adaptive Routing Algorithms for Lifetime Reliability Optimization in Network-on-Chip
Authors: Liang Wang;Xiaohang Wang;Terrence Mak
subject: dynamic programming|Routing algorithm|network-on-chip|lifetime reliability
Year: 2016
Publisher: IEEE
Abstract: Technology scaling leads to the reliability issue as a primary concern in Network-on-Chip (NoC) design. We observe that due to routing algorithm some routers age much faster than others which becomes a bottleneck for NoC lifetime. In this paper, 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. The problem is then extended for both performance and lifetime reliability optimization. The lifetime is optimized in long-term time scale while performance is optimized in short-term time scale. Two dynamic programming-based adaptive routing algorithms (lifetime aware routing and multi-objective routing) are proposed to solve the problems. In the experiments, the lifetime aware routing and multi-objective routing algorithms are evaluated with synthetic traffic and real benchmarks respectively. The experimental results show that the lifetime aware routing has around 20, 45 and 55 percent minimal lifetime improvement than XY routing, NoP routing and Oddeven routing, respectively. In addition, the multi-objective adaptive routing algorithm can effectively improve both performance and lifetime.
Description: 
URI: http://localhost/handle/Hannan/174532
ISSN: 0018-9340
volume: 65
issue: 9
More Information: 2896
2902
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7349176.pdf419.19 kBAdobe PDFThumbnail
Preview File
Title: Adaptive Routing Algorithms for Lifetime Reliability Optimization in Network-on-Chip
Authors: Liang Wang;Xiaohang Wang;Terrence Mak
subject: dynamic programming|Routing algorithm|network-on-chip|lifetime reliability
Year: 2016
Publisher: IEEE
Abstract: Technology scaling leads to the reliability issue as a primary concern in Network-on-Chip (NoC) design. We observe that due to routing algorithm some routers age much faster than others which becomes a bottleneck for NoC lifetime. In this paper, 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. The problem is then extended for both performance and lifetime reliability optimization. The lifetime is optimized in long-term time scale while performance is optimized in short-term time scale. Two dynamic programming-based adaptive routing algorithms (lifetime aware routing and multi-objective routing) are proposed to solve the problems. In the experiments, the lifetime aware routing and multi-objective routing algorithms are evaluated with synthetic traffic and real benchmarks respectively. The experimental results show that the lifetime aware routing has around 20, 45 and 55 percent minimal lifetime improvement than XY routing, NoP routing and Oddeven routing, respectively. In addition, the multi-objective adaptive routing algorithm can effectively improve both performance and lifetime.
Description: 
URI: http://localhost/handle/Hannan/174532
ISSN: 0018-9340
volume: 65
issue: 9
More Information: 2896
2902
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7349176.pdf419.19 kBAdobe PDFThumbnail
Preview File