Name
Abstract | ||
|---|---|---|
Coarse-grained reconfigurable architectures (CGRAs) provide high energy efficiency with word-level programmability rather than bit-level ones such as FPGAs. The coarser reconfigurability brings about higher energy efficiency and reduces the complexity of compiler tasks compared to the FPGAs. However, application mapping process for CGRAs is still time-consuming. When the compiler tries to map a large and complicated application data-flow-graph(DFG) onto the reconfigurable fabric, it tends to result in inefficient resource use or to fail in mapping. In case of failure, the compiler must divide it into several sub-DFGs and goes back to the same flow. In this work, we propose a novel partitioning method based on a genetic algorithm to eliminate the unmappable DFGs and improve the mapping quality. In order not to generate unmappable sub-DFGs, we also propose an estimation model which predicts the mappability and resource requirements using a DGCNN (Deep Graph Convolutional Neural Network). The genetic algorithm with this model can seek the most resource-efficient mapping without the back-end mapping process. Our model can predict the mappability with more than 98% accuracy and resource usage with a negligible error for two studied CGRAs. Besides, the proposed partitioning method demonstrates 53-75% of memory saving, 1.28-1.39x higher throughput, and better mapping quality over three comparative approaches. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TPDS.2021.3107746 | IEEE Transactions on Parallel and Distributed Systems |
Keywords | DocType | Volume |
Coarse-grained reconfigurable architecture,CGRA,deep learning,genetic algorithm,graph partitioning | Journal | 33 |
Issue | ISSN | Citations |
5 | 1045-9219 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takuya Kojima | 1 | 17 | 7.91 |
| Ayaka Ohwada | 2 | 0 | 0.68 |
| Hideharu Amano | 3 | 1375 | 210.21 |