{'fraction_non_alphanumeric': 0.015046296296296295, 'fraction_numerical': 0.0, 'mean_word_length': 4.844594594594595, '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}}
Dynamic CPU cache management under the loop model

Concerns cache designs using replacement strategies to provide the high performance required by fast CPUs. We propose a new replacement technique that uses some heuristic to detect loop structures in the reference patterns. Initially, the proposed technique uses the least recently used (LRU) strategy. Once a loop has been detected, all the references, which would result in poor performance if they were to be cached, will be dynamically excluded from being stored in the cache. The LRU strategy will resume as soon as the end of the loop has been detected. We have also developed a simulation program to compare the performance of this scheme to that of other related ones so as to demonstrate its effectiveness. The results show our scheme outperforms the others when the system references are loop dominated.