{'fraction_non_alphanumeric': 0.017054263565891473, 'fraction_numerical': 0.0031007751937984496, 'mean_word_length': 5.09433962264151, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Indirect Branch Prediction : A Survey of Issues and Techniques

There has been an increase in the use of Objected-Oriented languages for application development in the last one and a half decade. Developers make extensive use of virtual functions and late binding techniques offered by most OOP languages. These techniques internally make use of Indirect Branch Prediction [1]. The prediction accuracy of Indirect branch predictors is lower when compared to the more predictable conditional branches [2]. In this paper we look at recent works on different methods for branch prediction and present a survey on their advantages and disadvantages.