Abstract
This paper presents a cluster-based coarse grained reconfigurable array (CGRA) architecture and a corresponding modulo scheduling method for the inner-most loop. The reconfigurable clusters in this CGRA are composed of generic processing elements (PE) and shared PEs. The local connectivity of a cluster is utilized in the proposed mapping heuristic. Routing in the PE array is avoided because data transmission is within a cluster or between adjacent clusters in the heuristic. Experiment shows that the architecture and method outperform other modulo scheduling algorithms on CGRA. Better execution delay and resource utilization ratio can be achieved at 9.8%.
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 callDisclaimer: 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.
