Non-minimal routing strategy for application-specific Networks-on-Chips

Hiroki Matsutani, Michihiro Koibuchi, Yutaka Yamada, Akiya Jouraku, Hideharu Amano

Research output: Contribution to journalConference article

13 Citations (Scopus)

Abstract

We propose a deterministic routing strategy called flee which introduces non-minimal paths in order to distribute traffic with a high degree of communication locality in Networks-on-Chips, In the recent design methodology, target system and its application of the Systems-on-a-Chip are designed in system level description language like System-C, and simulated in the early stage of design. The task distribution is statically decided in this stage, and the amount of traffic between nodes can be analyzed. According to the analysis, a path that transfers a large amount of total data is firstly assigned with a relaxed limitation, thus it is mostly minimal. On the other hand, paths for small amount of total data, are secondly established so as not to disturb previously established paths, thus they are sometimes non-minimal. Simulation results show that the flee routing strategy improves up to 28.6% of throughput against the dimension-order routing on typical stream processing application programs.

Original languageEnglish
Article number1488705
Pages (from-to)273-281
Number of pages9
JournalProceedings of the International Conference on Parallel Processing Workshops
Volume2005
DOIs
Publication statusPublished - 2005 Dec 1
EventInternational Conference on Parallel Processing Workshops 2005, ICPP 2005 - Oslo, Norway
Duration: 2005 Jun 142005 Jun 17

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Non-minimal routing strategy for application-specific Networks-on-Chips'. Together they form a unique fingerprint.

  • Cite this