TY - JOUR
T1 - A sophisticated routing algorithm in 3D NoC with fixed TSVs for low energy and latency
AU - Jiang, Xin
AU - Zeng, Lian
AU - Watanabe, Takahiro
N1 - Funding Information:
Acknowledgments This research was partly supported by JSPS KAKENHI 23500069.
Publisher Copyright:
© 2014 Information Processing Society of Japan.
PY - 2014
Y1 - 2014
N2 - With rapid progress in Integrated Circuit technologies, Three-Dimensional Network-on-Chips (3DNoCs) have become a promising solution for achieving low latency and low power. Under the constraint of the TSV number used in 3DNoCs, designing a proper routing algorithm with fewer TSVs is a critical problem for network performance improvement. In this work, we design a novel fully adaptive routing algorithm in 3D NoC. The algorithm consists of two parts: one is a vertical node assignment in inter-layer routing, which is a TSV selection scheme in a limited quantity of TSVs in the NoC architecture, and the other is a 2D fully adaptive routing algorithm in intra-layer routing, which combines the optimization of routing distance, network traffic condition and diversity of the path selection. Simulation results show that our proposed routing algorithm can achieve lower latency and energy consumption compared with other traditional routing algorithms.
AB - With rapid progress in Integrated Circuit technologies, Three-Dimensional Network-on-Chips (3DNoCs) have become a promising solution for achieving low latency and low power. Under the constraint of the TSV number used in 3DNoCs, designing a proper routing algorithm with fewer TSVs is a critical problem for network performance improvement. In this work, we design a novel fully adaptive routing algorithm in 3D NoC. The algorithm consists of two parts: one is a vertical node assignment in inter-layer routing, which is a TSV selection scheme in a limited quantity of TSVs in the NoC architecture, and the other is a 2D fully adaptive routing algorithm in intra-layer routing, which combines the optimization of routing distance, network traffic condition and diversity of the path selection. Simulation results show that our proposed routing algorithm can achieve lower latency and energy consumption compared with other traditional routing algorithms.
KW - 3D NoC
KW - Fully adaptive
KW - Routing algorithm
UR - http://www.scopus.com/inward/record.url?scp=84986891177&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84986891177&partnerID=8YFLogxK
U2 - 10.2197/ipsjtsldm.7.101
DO - 10.2197/ipsjtsldm.7.101
M3 - Article
AN - SCOPUS:84986891177
SN - 1882-6687
VL - 7
SP - 101
EP - 109
JO - IPSJ Transactions on System LSI Design Methodology
JF - IPSJ Transactions on System LSI Design Methodology
ER -