Technical Papers of 2014 International Symposium on VLSI Design, Automation and Test 2014
DOI: 10.1109/vlsi-dat.2014.6834909
|View full text |Cite
|
Sign up to set email alerts
|

C3Map and ARPSO based mapping algorithms for energy-efficient regular 3-D NoC architectures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 4 publications
0
9
0
Order By: Relevance
“…Many researchers have done lots of work on multi-objective mapping. Some studies are done to optimise one metric (reliability, communication energy, temperature or performance) [5][6][7][8][9][10]. Some studies are done to optimise two or three metrics [2,11,12].…”
Section: Introductionmentioning
confidence: 99%
“…Many researchers have done lots of work on multi-objective mapping. Some studies are done to optimise one metric (reliability, communication energy, temperature or performance) [5][6][7][8][9][10]. Some studies are done to optimise two or three metrics [2,11,12].…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, the bit energy values for the link and the router is set to 0.449 pJ and 4.171 pJ, respectively according to [5].…”
Section: Energy Modelmentioning
confidence: 99%
“…Some are based on heuristic algorithms, such as genetic algorithm (GA), Simulated Annealing algorithm (SA), Particle Swarm algorithm (PS) and so on [3,4,5]. The others are based on specialized algorithms for NoC mapping [6,7,8].…”
Section: Introductionmentioning
confidence: 99%
“…To map k IP cores on n network nodes ( k ≤ n ), the possible core arrangements ( N _ag) on the NoC network is given by: Nag=n!)(nk!. Therefore, it is a combinatorial optimisation problem that requires efficient heuristic algorithms to get solutions. Different heuristic algorithms have been proposed in the literature which try to get the best answer in the limited computing resources, such as BMAP (batch Markovian arrival process), SMAP (smart mobile access point), NMAP (near‐optimal mapping), SA (simulated annealing algorithm), PSO (particle swarm optimisation), GA (genetic algorithm), ACO (ant colony optimisation), GHA (genetic‐based hyper‐heuristic algorithm), [715]. GA is a very efficient algorithm which is often used in NoC mapping solutions, [14, 1618].…”
Section: Introductionmentioning
confidence: 99%