{'fraction_non_alphanumeric': 0.016822429906542057, 'fraction_numerical': 0.007476635514018692, 'mean_word_length': 5.090909090909091, '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}}
An analysis of a use bit page replacement algorithm

The use bit algorithms have been proposed as approximations to least-recently-used page replacement algorithms. In this paper we describe two approximate Markov models and demonstrate their accuracy by comparison with simulations of paging behavior derived from traces of programs for the CDC 6600 computer. The use bit algorithm is found to be a good approximation to the least-recently-used algorithm. Furthermore, the models give reasonable predictions of the missing page rates.