Data-flow graph mapping optimization for CGRA with deep reinforcement learning

D Liu, S Yin, G Luo, J Shang, L Liu… - … on Computer-Aided …, 2018 - ieeexplore.ieee.org
D Liu, S Yin, G Luo, J Shang, L Liu, S Wei, Y Feng, S Zhou
IEEE Transactions on Computer-Aided Design of Integrated Circuits …, 2018ieeexplore.ieee.org
Coarse-grained reconfigurable architectures (CGRAs) have drawn increasing attention due
to their flexibility and energy efficiency. Data flow graphs (DFGs) are often mapped onto
CGRAs for acceleration. The problem of DFG mapping is challenging due to the diverse
structures from DFGs and constrained hardware from CGRAs. Consequently, it is difficult to
find a valid and high quality solution simultaneously. Inspired from the great progress in
deep reinforcement learning (RL) for AI problems, we consider building methods that learn …
Coarse-grained reconfigurable architectures (CGRAs) have drawn increasing attention due to their flexibility and energy efficiency. Data flow graphs (DFGs) are often mapped onto CGRAs for acceleration. The problem of DFG mapping is challenging due to the diverse structures from DFGs and constrained hardware from CGRAs. Consequently, it is difficult to find a valid and high quality solution simultaneously. Inspired from the great progress in deep reinforcement learning (RL) for AI problems, we consider building methods that learn to map DFGs onto spatially programmed CGRAs directly from experiences. We propose RLMap, a solution that formulates DFG mapping on CGRA as an agent in RL, which unifies placement, routing and processing element insertion by interchange actions of the agent. Experimental results show that RLMap performs comparably to state-of-the-art heuristics in mapping quality, adapts to different architecture, and converges quickly.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果

Google学术搜索按钮

example.edu/paper.pdf
搜索
获取 PDF 文件
引用
References