Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
LEAD: An Adaptive 3D-NoC Routing Algorithm with Queuing-Theory Based Analytical Verification
Univ Calif Irvine, Dept Elect Engn & Comp Sci, Irvine, CA 92697 USA..
Univ Calif Irvine, Dept Elect Engn & Comp Sci, Irvine, CA 92697 USA..
KTH. Univ Turku, SF-20500 Turku, Finland..
Univ Calif Irvine, Dept Elect Engn & Comp Sci, Irvine, CA 92697 USA..
2018 (English)In: I.E.E.E. transactions on computers (Print), ISSN 0018-9340, E-ISSN 1557-9956, Vol. 67, no 8, p. 1153-1166Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
IEEE Computer Society, 2018. Vol. 67, no 8, p. 1153-1166
Keywords [en]
3D network-on-chip, routing algorithm, deadlock-free, queuing theory, analytical model, latency
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:kth:diva-232751DOI: 10.1109/TC.2018.2801298ISI: 000438724000007Scopus ID: 2-s2.0-85041506447OAI: oai:DiVA.org:kth-232751DiVA, id: diva2:1237016
Note

QC 20180807

Available from: 2018-08-07 Created: 2018-08-07 Last updated: 2019-08-02Bibliographically approved

Open Access in DiVA

fulltext(2040 kB)12 downloads
File information
File name FULLTEXT01.pdfFile size 2040 kBChecksum SHA-512
c21cc3859231bd000d4b850de1bfd56daf18af7c05e8fa0fefe1f1512790cc3c30ead489e743be8adfe6b6e7dc061eee0837936917823c5a384cc4bb950e5257
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Ebrahimi, Masoumeh
By organisation
KTH
In the same journal
I.E.E.E. transactions on computers (Print)
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 12 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 6 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf