CART: Communication-Aware Routing Technique for Application-Specific NoCs

Tornero, Rafael; Ordua, J.M.; Mejı́a, Andrés; Flich, José; Duato, J.

doi:10.1109/dsd.2008.19

Cited by 4 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first one consists of developing a new communication-aware, topologyagnostic routing technique (CART) [7]. The second one consists of integrating the topological mapping technique described earlier in a methodology for designing application specific routing algorithms (AP-SRA) with the aim of providing a multi-objective strategy for concurrent mapping and path selection [8].…”

Section: Results Obtainedmentioning

confidence: 99%

“…In order to achieve this goal, we propose a new topological mapping technique that can be applied to application-specific NoCs with both regular and irregular topologies [6]. Since this technique has been designed for NoCs based on distributed routing [7], [8], the second step consists of adapting this technique to support NoC platforms using source routing [9]. In turn, the adaptation to source routing needs the development of a heuristic technique specifically designed for this case.…”

Section: The Proposed Approach and Methodologymentioning

confidence: 99%

See 1 more Smart Citation

Improving topological mapping on NoCs

Tornero

Orduña

2010

2010 IEEE International Symposium on Parallel &Amp; Distributed Processing, Workshops and PHD Forum (IPDPSW)

Self Cite

View full text Add to dashboard Cite

Section: Results Obtainedmentioning

confidence: 99%

Section: The Proposed Approach and Methodologymentioning

confidence: 99%

Improving topological mapping on NoCs

Tornero

Orduña

2010

2010 IEEE International Symposium on Parallel &Amp; Distributed Processing, Workshops and PHD Forum (IPDPSW)

Self Cite

View full text Add to dashboard Cite

“…The proposed technique consists of the joint use of these two methods in such a way that they have the greatest impact as possible on system performance. Some preliminary results had shown that the joint application of the two techniques can improve the network performance [12]. In this sense, the evaluation results show that the SR method provides an efficient topology-agnostic routing algorithm, while the communicationaware mapping technique optimizes the performance of the segmentation and restrictions chosen for a given topology.…”

Section: Introductionmentioning

confidence: 96%

“…Since some preliminary results show that the joint application of the two latter methods can improve the network performance [12], in this paper we analyze the variability of the mapping technique when used in combination with different routing algorithms based on SR. Since the SR methodology allows us to quickly compute a very large number of routing algorithms, we study how the choice of a routing algorithm affects the effectiveness of the task mapping technique and vice-versa.…”

Section: Introductionmentioning

confidence: 99%

A Communication-Driven Routing Technique for Application-Specific NoCs

Tornero

Orduña

Mejı́a

et al. 2010

Int J Parallel Prog

View full text Add to dashboard Cite

Networks on Chip (NoCs) have been shown as an efficient solution to the complex on-chip communication problems derived from the increasing number of processor cores. One of the key issues in the design of NoCs is the reduction of both area and power dissipation. As a result, two-dimensional meshes have become the preferred topology, since it offers low and constant link delay. Unfortunately, manufacturing defects or even real-time failures often make the resulting topology to become irregular, preventing the use of traditional routing algorithms. This scenario shows the need for topology-agnostic routing algorithms that provide a valid routing solution when applied over any topology. This paper proposes a new communication-driven routing technique that optimizes the network performance for Application-Specific NoCs. This technique combines a flexible, topology-agnostic routing algorithm with a communication-aware mapping technique that matches the traffic generated by the application with the available network bandwidth. Since the mapping technique can be pruned as needed in order to fit either quality function values or time constraints, this technique can be adapted to fit with different computational costs. The evaluation results show that it significantly improves network performance in terms of both latency and power consumption.

show abstract