{'fraction_non_alphanumeric': 0.04074702886247878, 'fraction_numerical': 0.0, 'mean_word_length': 4.412844036697248, '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}}
CFG in sub-graph matching based HW/SW Co-Design

In this paper, a method considering CFG's effect on the costs of sub-graph matching based HW/SW system is proposed. First, a discussion of all kinds of effects generated by CFG in sub-graph matching based co-design is made. Next, an algorithm called "Grade Every Sub-Graph of a DFG According to Its Execution Frequency Decided by CFG" (GESG) is proposed unifying all these effects. At last, delay cost function of sub-graph matching based HW/SW system is modified according to GESG. Experiments and their results are reported and discussed.