TY - GEN
T1 - A routing strategy for inductive-coupling based wireless 3-D NoCs by maximizing topological regularity
AU - Sasaki, Daisuke
AU - Zhang, Hao
AU - Matsutani, Hiroki
AU - Koibuchi, Michihiro
AU - Amano, Hideharu
PY - 2013
Y1 - 2013
N2 - Inductive-coupling is a 3D integration technique that can stack more than three known-good-dies in a System-in-Package (SiP) without wire connections. To make the best use of wireless property, the 3D ICs would have a great flexibility to customize the number of processor chips, SRAM chips, and DRAM chips in a SiP after the chip fabrication. In this work, we design a deadlock-free routing protocol for such 3-D chips in which each chip has different Network-on-Chip (NoC) topologies. We classify two-surface NoC of each chip into is 2D mesh and irregular structure in order to apply the custom routing algorithm to its topology. In mesh topologies, X-Y routing is used for well traffic distribution, while Up*/Down* routing is applied for reduced path hops in irregular topologies. Evaluation results show that the average number of hop count in uniform traffic can be improved by up to 11.8%, and the average hop count in neighbor traffic can be improved up to 6.1%.
AB - Inductive-coupling is a 3D integration technique that can stack more than three known-good-dies in a System-in-Package (SiP) without wire connections. To make the best use of wireless property, the 3D ICs would have a great flexibility to customize the number of processor chips, SRAM chips, and DRAM chips in a SiP after the chip fabrication. In this work, we design a deadlock-free routing protocol for such 3-D chips in which each chip has different Network-on-Chip (NoC) topologies. We classify two-surface NoC of each chip into is 2D mesh and irregular structure in order to apply the custom routing algorithm to its topology. In mesh topologies, X-Y routing is used for well traffic distribution, while Up*/Down* routing is applied for reduced path hops in irregular topologies. Evaluation results show that the average number of hop count in uniform traffic can be improved by up to 11.8%, and the average hop count in neighbor traffic can be improved up to 6.1%.
UR - http://www.scopus.com/inward/record.url?scp=84892860060&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84892860060&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-03889-6_9
DO - 10.1007/978-3-319-03889-6_9
M3 - Conference contribution
AN - SCOPUS:84892860060
SN - 9783319038889
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 77
EP - 85
BT - Algorithms and Architectures for Parallel Processing - 13th International Conference, ICA3PP 2013, Proceedings
T2 - 13th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2013
Y2 - 18 December 2013 through 20 December 2013
ER -