Resource constrained mapping of data flow graphs onto coarse-grained reconfigurable array

This paper proposes a heuristic algorithm to the resource constrained mapping problem in coarse-grained reconfigurable computing, such that the partition number and communications are co-optimized to improve the application performance. Our approach modifies the network flow algorithm with a customized mapping procedure embedded to satisfy the micro-architecture resource constraints. Additionally, we use integer linear programming to set optimal baseline to the problem. Our algorithms reformulate the cost function by identifying some flaws in previous literatures. The experiment results qualify the benefit gained by our proposed approach.