Please use this identifier to cite or link to this item: https://doi.org/10.1109/FPT.2012.6412149
Title: Graph minor approach for application mapping on CGRAs
Authors: Chen, L.
Mitra, T. 
Issue Date: 2012
Source: Chen, L.,Mitra, T. (2012). Graph minor approach for application mapping on CGRAs. FPT 2012 - 2012 International Conference on Field-Programmable Technology : 285-292. ScholarBank@NUS Repository. https://doi.org/10.1109/FPT.2012.6412149
Abstract: Coarse-grained reconfigurable arrays (CGRA) exhibit high performance, improved flexibility, low cost, and power efficiency for various application domains. Compute-intensive loop kernels are mapped to CGRA through modified modulo scheduling algorithms that integrate placement and routing. Most existing approaches are heavily influenced by VLIW compilation and FPGA synthesis techniques. A salient feature of these approaches is that data routing from a single source node to multiple destination nodes follow independent paths leading to resource wastage and hence inefficient schedule.We transform the CGRA mapping problem with route sharing into a graph minor problem. Our graph minor formalization provides a solid foundation for application mapping on CGRA. We provide an efficient framework based on graph mapping to solve this problem. Experimental validation shows that our approach leads to higher performance compared to state-of-the-art solutions with better resource utilization and minimal compilation time. © 2012 IEEE.
Source Title: FPT 2012 - 2012 International Conference on Field-Programmable Technology
URI: http://scholarbank.nus.edu.sg/handle/10635/41497
ISBN: 9781467328449
DOI: 10.1109/FPT.2012.6412149
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

15
checked on Dec 13, 2017

Page view(s)

46
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.