Abstract
Coarse-grained reconfigurable array(CGRA) has gained popularity in compute-intensive applications because of its flexibility and energy-efficiency. When mapping the data flow graph(DFG) abstracted from the kernel loop of the application to CGRA, for data routing especially DFGs with high fan-out operations, data transfer through the global register file (GRF) and insert routing/recomputation operations in the DFG are two ways that can serve as routing paths, but with increased power cost. For the data routing in these complex DFGs, we propose a new routing mode, bus routing, to exploit the buses as routing paths between PEs without GRF access and inserted operations. A mapping method incorporating bus routing, BusMap, is proposed to map the DFG onto CGRA by solving the maximum independent set(MIS) on a quadruple resource occupation conflict graph. The experiment results show BusMap can achieve fewer GRF access and inserted operations while having the same or even smaller initiation interval(II) compared to previous works.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
