{'fraction_non_alphanumeric': 0.0070921985815602835, 'fraction_numerical': 0.0, 'mean_word_length': 5.957746478873239, '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}}
Probabilistic Estimation of Resource Affinities of Processes in Computing Systems

The determination of various resource affinities of processes is an important parameter for making effective scheduling decisions by the schedulers in any operating systems kernel. The resource affinities of a set of processes may be dynamic in nature based on application logic and execution environments. This paper proposes a novel probabilistic estimation model and corresponding classifier algorithm to segregate processes in different queues based on respective resource affinities. The classifier algorithm is online in nature and tracks the dynamic variations of resource affinity patterns of processes. The algorithm classifies processes according to resource affinities for scheduling purposes. The effects of dilated estimation periods are investigated. Experimental results indicate that the estimation model and algorithm successfully classifies a set of processes based on execution traces.