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
Efficient Congestion-Aware Scheme for Wireless On-Chip Networks
KTH, School of Information and Communication Technology (ICT), Electronics and Embedded Systems.
2016 (English)In: 2016 24TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING (PDP), Institute of Electrical and Electronics Engineers (IEEE), 2016, 742-749 p.Conference paper, Published paper (Refereed)
Abstract [en]

Wireless NoC is becoming popular to be a promising future on-chip interconnection network as a result of high bandwidth, low latency and flexible topology configurations provided by this emerging technology. Nonetheless, congestion occurrence in wireless routers negatively affects the usability of high speed wireless links and considerably increases the network latency; therefore, in this paper, a congestion-aware platform (CAP-W) is introduced for wireless NoCs in order to reduce both internal and external congestions. The whole platform of CAP-W consists of an adaptive routing algorithm that balances utilization of wired and wireless networks, a dynamic task mapping approach that tries to minimize congestion probability, and a task migration strategy that considers dynamic variation of application behaviors. Simulation results show significant gain in congestion control over PEs of wireless NoC, compared to state-of-the-art works.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2016. 742-749 p.
Series
Euromicro Conference on Parallel Distributed and Network-Based Processing, ISSN 1066-6192
Keyword [en]
Network-on-Chip, Wireless Network-on-Chip, Congestion, Dynamic Application Mapping, Adaptive Routing Algorithm, Task Migration
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-193256DOI: 10.1109/PDP.2016.88ISI: 000381810900110Scopus ID: 2-s2.0-84968845944ISBN: 978-1-4673-8776-7 (print)OAI: oai:DiVA.org:kth-193256DiVA: diva2:1033631
Conference
24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP), FEB 17-19, 2016, Heraklion, GREECE
Note

QC 20161007

Available from: 2016-10-07 Created: 2016-09-30 Last updated: 2016-10-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Daneshtalab, Masoud
By organisation
Electronics and Embedded Systems
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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