The University of Southampton
University of Southampton Institutional Repository
Warning ePrints Soton is experiencing an issue with some file downloads not being available. We are working hard to fix this. Please bear with us.

A non-minimal routing algorithm for aging mitigation in 2D-mesh NoCs

A non-minimal routing algorithm for aging mitigation in 2D-mesh NoCs
A non-minimal routing algorithm for aging mitigation in 2D-mesh NoCs

Due to technology scaling, aging issue is becoming one of major concerns in the design of Network-on-Chip. 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.

Aging, dynamic programming., network-on-chip, non-minimal routing, routing algorithm
0278-0070
Wang, Liang
09b9a7f4-7732-43cb-aec0-ab671d309f93
Wang, Xiaohang
95ffd2f0-3e1f-4cbe-8067-b600d6a08f75
Leung, Ho Fung
1a8a18ad-f6a8-4516-850e-3909d6df2ab9
Mak, Terrence
0f90ac88-f035-4f92-a62a-7eb92406ea53
Wang, Liang
09b9a7f4-7732-43cb-aec0-ab671d309f93
Wang, Xiaohang
95ffd2f0-3e1f-4cbe-8067-b600d6a08f75
Leung, Ho Fung
1a8a18ad-f6a8-4516-850e-3909d6df2ab9
Mak, Terrence
0f90ac88-f035-4f92-a62a-7eb92406ea53

Wang, Liang, Wang, Xiaohang, Leung, Ho Fung and Mak, Terrence (2018) A non-minimal routing algorithm for aging mitigation in 2D-mesh NoCs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. (doi:10.1109/TCAD.2018.2855149).

Record type: Article

Abstract

Due to technology scaling, aging issue is becoming one of major concerns in the design of Network-on-Chip. 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.

This record has no associated files available for download.

More information

Accepted/In Press date: 11 July 2018
e-pub ahead of print date: 12 July 2018
Keywords: Aging, dynamic programming., network-on-chip, non-minimal routing, routing algorithm

Identifiers

Local EPrints ID: 425330
URI: http://eprints.soton.ac.uk/id/eprint/425330
ISSN: 0278-0070
PURE UUID: a6224d40-f398-4635-a71c-0e613c5dbde7

Catalogue record

Date deposited: 12 Oct 2018 16:30
Last modified: 25 Nov 2021 23:18

Export record

Altmetrics

Contributors

Author: Liang Wang
Author: Xiaohang Wang
Author: Ho Fung Leung
Author: Terrence Mak

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×