The Community for Technology Leaders
Green Image
Issue No. 08 - Aug. (2018 vol. 67)
ISSN: 0018-9340
pp: 1153-1166
Ronak Salamat , Department of Electrical Engineering and Computer Science, University of California Irvine, Irvine, CA
Misagh Khayambashi , Department of Electrical Engineering and Computer Science, University of California Irvine, Irvine, CA
Masoumeh Ebrahimi , University of Turku, Turku, Finland
Nader Bagherzadeh , Department of Electrical Engineering and Computer Science, University of California Irvine, Irvine, CA
ABSTRACT
2D-NoCs have been the mainstream approach used to interconnect multi-core systems. 3D-NoCs have emerged to compensate for deficiencies of 2D-NoCs such as long latency and power overhead. A low-latency routing algorithm for 3D-NoC is designed to accommodate high-speed communication between cores. Both simulation and analytical models are applied to estimate the communication latency of NoCs. Generally, simulations are time-consuming and slow down the design process. Analytical models provide, within a fraction of the time, nearly accurate results which can be used by simulation to fine-tune the design. In this paper, a high performance and adaptive routing algorithm has been proposed for partially connected 3D-NoCs. Latency of the routing algorithm under different traffic patterns, different number of elevators and different elevator assignment mechanisms are reported. An analytical model, tailored to the adaptivity of the algorithm and under low traffic scenarios, has been developed and the results have been verified by simulation. According to the results, simulation and analytical results are consistent within a 10 percent margin.
INDEX TERMS
Routing, Analytical models, Algorithm design and analysis, Through-silicon vias, Adaptation models, Elevators, Lead
CITATION

R. Salamat, M. Khayambashi, M. Ebrahimi and N. Bagherzadeh, "LEAD: An Adaptive 3D-NoC Routing Algorithm with Queuing-Theory Based Analytical Verification," in IEEE Transactions on Computers, vol. 67, no. 8, pp. 1153-1166, 2018.
doi:10.1109/TC.2018.2801298
168 ms
(Ver 3.3 (11022016))