{'fraction_non_alphanumeric': 0.016786570743405275, 'fraction_numerical': 0.0, 'mean_word_length': 5.900826446280992, '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}}
Exploration of Performance of Dynamic Branch Predictors used in Mitigating Cost of Branching

Today, Branch Predictors have become a sophisticated component in all modern processors. While contemporary predictors have good accuracy, the cost of a misprediction is quite high. Hence, active research is being conducted towards improving the performance of branch predictors, while reducing the resources consumed. Modern computer architectures increasingly rely on speculation to boost instruction-level parallelism (ILP). As the pipelines deepen and instructions issued per cycle increase, the accurate branch prediction mechanisms become more and more important in increasing the processor performance. This study explores some branch predictors and compares them on the basis of their performance on certain benchmarks applications.