Abstract
Synchronous dataflow graphs (SDFGs) are widely used to model streaming applications. Unfolding is one of the most important techniques for performance optimization of SDFGs. It may reduce the iteration period (IP) without affecting functionality. We present a novel method to compute the IPs of SDFGs by state-space exploration, without converting them to their equivalent homogeneous SDFGs (HSDFGs), and without further unfolding the HSDFGs. The conversion procedures are time and space-consuming. We also consider the cases when there are resource constraints, which cannot be dealt with by existing methods. Combining with retiming technique, we further present a method to compute the reduced IP of unfolded SDFGs. Our experimental results show that the proposed method outperforms the existing methods significantly.
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.
