An adaptive congestion-aware routing algorithm for mesh networkon-chip platform

Po-Tsang Huang*, Wei Hwang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

In this paper, an adaptive congestion-aware routing algorithm is proposed for mesh network-onchip (NoC) platforms. Depending on the traffic around the routed node, the proposed routing algorithm provides not only minimum paths but also non-minimum paths for routing packets. Both minimum and non-minimum paths are based on the odd-even turn model to avoid deadlock and livelock problems. The decision of the minimum paths or non-minimum paths depends on the utilities of buffers in neighbor nodes and the specific switching value. In this adaptive algorithm, the congestion conditions and distributed hotspots will be avoided. It has the advantages of getting higher performance and also reducing the latency. From the simulation results, it shows that the adaptive congestion-aware routing algorithm is superior to other algorithms for the mesh NoC platforms.

Original languageEnglish
Title of host publicationProceedings - IEEE International SOC Conference, SOCC 2009
Pages375-378
Number of pages4
DOIs
StatePublished - 1 Dec 2009
EventIEEE International SOC Conference, SOCC 2009 - Belfast, Ireland
Duration: 9 Sep 200911 Sep 2009

Publication series

NameProceedings - IEEE International SOC Conference, SOCC 2009

Conference

ConferenceIEEE International SOC Conference, SOCC 2009
Country/TerritoryIreland
CityBelfast
Period9/09/0911/09/09

Fingerprint

Dive into the research topics of 'An adaptive congestion-aware routing algorithm for mesh networkon-chip platform'. Together they form a unique fingerprint.

Cite this