A Spatial Mapping Algorithm for Heterogeneous Coarse-Grained Reconfigurable Architectures

Download Now
Provided by: edaa
Format: PDF
In this paper, the authors investigate the problem of automatically mapping applications onto a coarse-grained reconfigurable architecture and propose an efficient algorithm to solve the problem. They formalize the mapping problem and show that it is NP-complete. To solve the problem within a reasonable amount of time, they divide it into three sub-problems: covering, partitioning and layout. Their empirical results demonstrate that their technique produces nearly as good performance as hand-optimized outputs for many kernels.
Download Now

Find By Topic