Paper Info
Title
Mapping DAG to CGRA Using Min-Max Ant Colony System
Abstract
Coarse-grained reconfigurable array (CGRA) architecture has become popular because of its performance and flexibility. The efficiency of CGRA relies on an efficient application mapping algorithm to exploit parallelisms. In this paper, we formalized the temporal mapping problem and proposed the min-max ant colony system (MMAS) algorithm for CGRA mapping. Further optimization of MMAS is studied to reduce mapping time while maintaining the quality of solutions. Comparisons with other heuristic algorithms show that our approach obtains better results in less mapping time.
Year
DOI
Venue
2013
10.1109/CyberC.2013.96
CyberC
Keywords
Field
DocType
mapping dag,cgra efficiency,cgra mapping,mmas algorithm,mmas,ant colony optimisation,efficient application mapping algorithm,application mapping algorithm,temporal mapping problem,directed acyclic graph,reconfigurable architectures,min-max ant colony system,better result,mapping time reduction,heuristic algorithm,application mapping,minimax techniques,dag,mmas optimization,heuristic algorithms,directed graphs,minmax ant colony system algorithm,cgrat,coarse-grained reconfigurable array architecture,coarse-grained reconfigurable array,mapping time
Kernel (linear algebra),Reconfigurable array,Heuristic,Algorithm design,Computer science,Parallel computing,Directed graph,Theoretical computer science,Real-time computing,Mapping algorithm,Ant colony,Signal processing algorithms
Conference
Citations 
PageRank 
References 
0
0.34
12
Authors
2
Name
Order
Citations
PageRank
Li Zhou100.34
Hengzhu Liu28623.28