Comparative ODE benchmarking of unidirectional and bidirectional DP networks for 3D-IC
Refereed conference paper presented and published in conference proceedings

CUHK Authors
Author(s) no longer affiliated with CUHK

Times Cited
Altmetrics Information

Other information
AbstractThere has been great technological stride in 3D-IC on its design, analysis, and fabrication, with prediction that they will eventually lead to significant advances in multicore, multiprocessor, and network-on-chip (NoC) systems. A dynamic programming (DP) network is well suited for the grid stack architecture, because of its capability to achieve global optimality using only local computational units with short inter-grid communication links. In this paper we extend the transitive closure and shortest path unidirectional networks to bidirectional networks, with the development of an effective simulation tool for such type of DP networks. In addition to helping to construct real DP networks on 3D-IC, ODE (ordinary differential equation) simulation methodology for solving an average shortest path length problem provides new insights for comparative bench-marking very large-scale 2D/3D networks for different design considerations in application. © 2011 IEEE.
All Author(s) ListLam K.P., Mak T.S.T., Poon C.-S.
Name of Conference2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip, VLSI-SoC 2011
Start Date of Conference03/10/2011
End Date of Conference05/10/2011
Place of ConferenceKowloon
Country/Region of ConferenceHong Kong
Detailed descriptionorganized by IEEE,
Pages98 - 101
LanguagesEnglish-United Kingdom

Last updated on 2020-08-08 at 00:18