Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
In-order delivery approach for 2D and 3D NoCs
KTH, School of Information and Communication Technology (ICT), Electronics and Embedded Systems. University of Turku, Turku, Finland.
KTH, School of Information and Communication Technology (ICT), Electronics and Embedded Systems. University of Turku, Turku, Finland.
2015 (English)In: Journal of Supercomputing, ISSN 0920-8542, E-ISSN 1573-0484, Vol. 71, no 8, 2877-2899 p.Article in journal (Refereed) Published
Abstract [en]

In many applications, it is critical to guarantee the in-order delivery of requests from the master cores to the slave cores, so that the requests can be executed in the correct order without requiring buffers. Since in NoCs packets may use different paths and on the other hand traffic congestion varies on different routes, the in-order delivery constraint cannot be met without support. To guarantee the in-order delivery, traditional approaches either use dimension-order routing or employ reordering buffers at network interfaces. Dimension-order routing degrades the performance considerably while the usage of reordering buffers imposes large area overhead. In this paper, we present a mechanism allowing packets to be routed through multiple paths in the network, helping to balance the traffic load while guaranteeing the in-order delivery. The proposed method combines the advantages of both deterministic and adaptive routing algorithms. The simple idea is to use different deterministic algorithms for independent flows. This approach neither requires reordering buffers nor limits packets to use a single path. The algorithm is simple and practical with negligible area overhead over dimension-order routing. The concept is investigated in both 2D and 3D mesh networks.

Place, publisher, year, edition, pages
2015. Vol. 71, no 8, 2877-2899 p.
Keyword [en]
2D mesh, 3D stacked mesh, In-order delivery
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-172703DOI: 10.1007/s11227-014-1339-yISI: 000358668000006Scopus ID: 2-s2.0-84943363958OAI: oai:DiVA.org:kth-172703DiVA: diva2:850052
Funder
VINNOVA
Available from: 2015-08-31 Created: 2015-08-27 Last updated: 2017-12-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Daneshtalab, MasoudEbrahimi, Masoumeh
By organisation
Electronics and Embedded Systems
In the same journal
Journal of Supercomputing
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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