Coarse Grained Reconfigurable Arrays (CGRAs) have been more and more popular recently due to their high performance with low power consumption. An intelligent compiler is essential to execute applications on CGRAs effectively. However, automatically compilation for CGRAs still faces many challenges though many algorithms have been proposed. In this paper, we present an effective mapping algorithm which is targetable to a parameterized architecture template. The main contributions are an effective priority scheme, a satisfying backtracking algorithm and a fast control data flow graph (CDFG) splitting method. The experimental results demonstrate that our technique gains the performance very close to manual optimization. © 2011 Springer-Verlag.
CITATION STYLE
Ma, L., Ge, W., & Qi, Z. (2011). A graph-based spatial mapping algorithm for a coarse grained reconfigurable architecture template. In Lecture Notes in Electrical Engineering (Vol. 133 LNEE, pp. 669–678). https://doi.org/10.1007/978-3-642-25992-0_89
Mendeley helps you to discover research relevant for your work.