.png){kind=icon}
返回
BusMap: Application Mapping With Bus Routing for Coarse-Grained Reconfigurable Array
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2023.3253686.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Coarse-grained reconfigurable array (CGRA) has gained popularity in compute-intensive applications because of its flexibility and energy-efficiency. When mapping the data flow graph (DFG) abstracted from the kernel loop of the application to CGRA, for data routing especially DFGs with high fan-out operations, data transfer through the global register file (GRF) and insert routing/recomputation operations in the DFG are two ways that can serve as routing paths, but with increased power cost. For the data routing in these complex DFGs, we propose a new routing mode, bus routing, to exploit the buses as routing paths between PEs without GRF access and inserted operations. A mapping method incorporating bus routing, BusMap, is proposed to map the DFG onto CGRA by solving the maximum independent set (MIS) on a quadruple resource occupation conflict graph. The experiment results show BusMap can achieve fewer GRF access and inserted operations while having the same or even smaller initiation interval (II) compared to previous works.
Keyword:
CGRA
GRF access
inserted operations
bus routing mode
BusMap
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
HReA: An Energy-Efficient Embedded Dynamically Reconfigurable Fabric for 13-Dwarfs ProcessingHReA: 一种用于13矮人处理的节能嵌入式动态可重构结构
PREAI
分享收藏If attitudes affect how stimuli are processed, should not they affect the event-related brain potential?如果态度影响刺激的处理方式，它们不应该影响与事件相关的大脑电位吗？.png)
IF0
PREAI
分享收藏
查看更多内容