2009
DOI: 10.1587/elex.6.1737
|View full text |Cite
|
Sign up to set email alerts
|

Crinkle: A heuristic mapping algorithm for network on chip

Abstract: Abstract:In this paper, a heuristic mapping algorithm which maps tasks, using priority lists and the crinkle moving pattern is proposed. To evaluate this algorithm, a set of real (i.e. Video Object Plan Decoder) and random applications have been used and the results have been compared. By reducing the number of hops between IP cores, the energy consumption and the completion time of the application (time which all tasks in the task graph execute wholly) have been optimized. Compared to other mapping algorithms… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 26 publications
(7 citation statements)
references
References 5 publications
0
7
0
Order By: Relevance
“…In this experiment, both randomly generated graphs and real benchmarks are evaluated. The proposed algorithm is compared against INC, 17 Nmap, 24 Castnet 31 and Crinkle 28 algorithms. We have extended the algorithms Nmap, CastNet and Crinkle to support 3D NoC.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…In this experiment, both randomly generated graphs and real benchmarks are evaluated. The proposed algorithm is compared against INC, 17 Nmap, 24 Castnet 31 and Crinkle 28 algorithms. We have extended the algorithms Nmap, CastNet and Crinkle to support 3D NoC.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…Crinkle 28 is a heuristic algorithm which is based on lists of prioritized tasks. First, the priority lists are organized according to the maximum communication volume or maximum out‐degree.…”
Section: Related Work and Motivationmentioning
confidence: 99%
See 1 more Smart Citation
“…A similar approach has been discussed in [89]. In [90], priority lists are created based on the communication bandwidth and degree of interconnection between nodes before mapping. Tasks are then mapped in a zigzag manner starting from one corner and end on another corner of the mesh-based NoC.…”
Section: • Constructive Heuristic With Iterative Improvementmentioning
confidence: 99%
“…In this section, we refer to the following weighted directed graphs to formulate this problem [10]. Definition 1: An Application Characterization Graph (APCG), is a directed weighted graph G(C, A), where each vertex c i ∈ C denotes an IP core, the directed arc a ij ∈ A denotes a communication trace from the IP core c i to the IP core c j , and the weight of each edge w ij indicates the communication volume on edge a ij .…”
Section: Mapping Modelmentioning
confidence: 99%