BusMap: Application Mapping With Bus Routing for Coarse-Grained Reconfigurable Array

Abstract

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 realize the application mapping with bandwidth allocation, BandMap maps the data flow graphs (DFGs), abstracted from applications' kernel loops, onto CGRA by solving the maximum independent set (MIS) on a mixture of tuple and quadruple resource occupation conflict graph. Compared to a stateof-the-art BusMap work, Bandmap can achieve reduced routing PEs with the same or even smaller initiation interval (II).