kth.sePublications KTH
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
Travel Time-Based Task Mapping for NoC-Based DNN Accelerator
KTH, School of Electrical Engineering and Computer Science (EECS), Electrical Engineering, Electronics and Embedded systems.ORCID iD: 0000-0001-8488-3506
KTH, School of Electrical Engineering and Computer Science (EECS), Electrical Engineering, Electronics and Embedded systems.ORCID iD: 0000-0002-4911-0257
KTH, School of Electrical Engineering and Computer Science (EECS), Electrical Engineering, Electronics and Embedded systems.ORCID iD: 0000-0003-0061-3475
2025 (English)In: Embedded Computer Systems: Architectures, Modeling, and Simulation - 24th International Conference, SAMOS 2024, Proceedings, Springer Nature , 2025, p. 76-92Conference paper, Published paper (Refereed)
Abstract [en]

Network-on-Chip (NoC) based architectures are recently proposed to accelerate deep neural networks in specialized hardware. Given that the hardware configuration is fixed post-manufacture, proper task mapping attracts researchers’ interest. We propose a travel time-based task mapping method that allocates uneven counts of tasks across different Processing Elements (PEs). This approach utilizes the travel time recorded in the sampling window and implicitly makes use of static NoC architecture information and dynamic NoC congestion status. Furthermore, we examine the effectiveness of our method under various configurations, including different mapping iterations, flit sizes, and NoC architectures. Our method achieves up to 12.1% improvement compared with even mapping and static distance mapping for one layer. For a complete NN example, our method achieves 10.37% and 13.75% overall improvements to row-major mapping and distance-based mapping, respectively. While ideal travel time-based mapping (post-run) achieves 10.37% overall improvements to row-major mapping, we adopt a sampling window to efficiently map tasks during the running, achieving 8.17% (sampling window 10) improvement.

Place, publisher, year, edition, pages
Springer Nature , 2025. p. 76-92
Keywords [en]
DNN accelerator, Network-on-Chip, Task mapping
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-360912DOI: 10.1007/978-3-031-78377-7_6ISI: 001447099800006Scopus ID: 2-s2.0-85218456046OAI: oai:DiVA.org:kth-360912DiVA, id: diva2:1942575
Conference
24th International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation, SAMOS 2024, Samos, Greece, June 29 - July 4, 2024
Note

Part of ISBN 9783031783760

QC 20250310

Available from: 2025-03-05 Created: 2025-03-05 Last updated: 2025-06-02Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Chen, YizhiZhu, WenyaoLu, Zhonghai

Search in DiVA

By author/editor
Chen, YizhiZhu, WenyaoLu, Zhonghai
By organisation
Electronics and Embedded systems
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 73 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