{'fraction_non_alphanumeric': 0.02391304347826087, 'fraction_numerical': 0.015217391304347827, 'mean_word_length': 5.065789473684211, '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}}
A novel dynamic scheduling algorithm of data hazard for embedded processor

To solve the data hazard of embedded processor, this paper designs a dynamic scheduling algorithm to improve the pipeline efficiency, which only increases one single-instruction buffer and some combination logic. In FFT and FIR experiment, the algorithm leads to the decrease of the pipeline conflict to 100% and 75% respectively. There is 8.2% additional area of the whole processor.