This paper proposes an application mapping algorithm, BandMap, for coarse-grained reconfigurable array (CGRA), which allocates the bandwidth in PE array according to the transferring demands of data, especially the data with high spatial reuse, to reduce the routing PEs. To cover bandwidth allocation, BandMap maps the data flow graphs (DFGs), abstracted from applications, by solving the maximum independent set (MIS) on a mixture of tuple and quadruple resource occupation conflict graph. Compared to a state-of-art BusMap work, Bandmap can achieve reduced routing PEs with the same or even smaller initiation interval (II).

翻译：本文提出了一种面向粗粒度可重构阵列（CGRA）的应用映射算法BandMap，该算法根据数据的传输需求（特别是具有高空间复用性的数据）在PE阵列中分配带宽，以减少路由PE的数量。为覆盖带宽分配，BandMap通过求解混合元组与四元组资源占用冲突图上的最大独立集（MIS）问题，对从应用中抽象出的数据流图（DFG）进行映射。与现有最先进的BusMap工作相比，BandMap能够在相同甚至更小的启动间隔（II）下减少路由PE的使用量。