Name
Abstract | ||
|---|---|---|
Coarse-grained reconfigurable array (CGRA) is a competitive hardware platform for computation intensive tasks in many application domains. The performance of CGRA heavily depends on the mapping algorithm which exploits different level of parallelisms. Unfortunately, the mapping problem on CGRA is proved to be NP-complete. In this paper, we propose a genetic based modulo scheduling algorithm to map application kernels onto CGRA. An efficient routing heuristic is also presented to reduce the mapping time. Experiment result shows our algorithm outperforms other heuristic algorithms both in solution's quality and mapping time. © Springer-Verlag Berlin Heidelberg 2013. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-37502-6_95 | BIC-TA |
Keywords | DocType | Volume |
CGRA,Genetic algorithm,Loop mapping | Conference | 212 |
Issue | Citations | PageRank |
null | 1 | 0.37 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li Zhou | 1 | 1 | 0.37 |
| Dongpei Liu | 2 | 19 | 3.60 |
| Min Tang | 3 | 14 | 5.04 |
| Hengzhu Liu | 4 | 86 | 23.28 |