{'fraction_non_alphanumeric': 0.02176278563656148, 'fraction_numerical': 0.0, 'mean_word_length': 5.524822695035461, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Efficient Algorithm for the Iteration Period Computation of Unfolded Synchronous Dataflow Graphs

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.