TY - GEN
T1 - Advertiser elevator
T2 - 60th IEEE International Midwest Symposium on Circuits and Systems, MWSCAS 2017
AU - Taheri, Ebadollah
AU - Isakov, Mihailo
AU - Patooghy, Ahmad
AU - Kinsy, Michel A.
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/9/27
Y1 - 2017/9/27
N2 - In this paper, we propose an adaptive routing algorithm for vertically partially connected 3D NoCs to (1) overcome failures in vertical links, and (2) find the nearest available vertical link for rerouting of packets. To track the position of each vertical link and distance to the other nodes, the proposed routing algorithm, named Advertiser Elevator, indexes each vertical link and implements a mechanism for announcing and sharing these indexes with the other nodes of the network. Packets are routed toward the nearest vertical link based on received indexes. The routing algorithm tolerates vertical link failures by interpreting the absence of index messages from a vertical link node as a link failure at the node. Packets are rerouted around failed links based on collected messages. The performance of the Advertiser Elevator routing algorithm is evaluated using the Access Noxim NoC simulator under different network congestion levels and fault rates. The results show that the proposed routing algorithm (1) is able to deliver packets as long as there are at least four live vertical links in the network (e.g., corner links) and (2) improves the average network latency by 15% over the well-known Elevator-First routing algorithm.
AB - In this paper, we propose an adaptive routing algorithm for vertically partially connected 3D NoCs to (1) overcome failures in vertical links, and (2) find the nearest available vertical link for rerouting of packets. To track the position of each vertical link and distance to the other nodes, the proposed routing algorithm, named Advertiser Elevator, indexes each vertical link and implements a mechanism for announcing and sharing these indexes with the other nodes of the network. Packets are routed toward the nearest vertical link based on received indexes. The routing algorithm tolerates vertical link failures by interpreting the absence of index messages from a vertical link node as a link failure at the node. Packets are rerouted around failed links based on collected messages. The performance of the Advertiser Elevator routing algorithm is evaluated using the Access Noxim NoC simulator under different network congestion levels and fault rates. The results show that the proposed routing algorithm (1) is able to deliver packets as long as there are at least four live vertical links in the network (e.g., corner links) and (2) improves the average network latency by 15% over the well-known Elevator-First routing algorithm.
UR - http://www.scopus.com/inward/record.url?scp=85034038391&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85034038391&partnerID=8YFLogxK
U2 - 10.1109/MWSCAS.2017.8052879
DO - 10.1109/MWSCAS.2017.8052879
M3 - Conference contribution
AN - SCOPUS:85034038391
T3 - Midwest Symposium on Circuits and Systems
SP - 136
EP - 139
BT - 2017 IEEE 60th International Midwest Symposium on Circuits and Systems, MWSCAS 2017
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 6 August 2017 through 9 August 2017
ER -