{'fraction_non_alphanumeric': 0.018270401948842874, 'fraction_numerical': 0.0, 'mean_word_length': 5.629032258064516, '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}}
Pfair scheduling improvement to reduce interprocessor migrations

Proportionate-fair (Pfair) scheduling is a particulary promising global scheduling technique for multiprocessor systems. Actually three Pfair scheduling algorithms have been proved optimal for scheduling periodic, sporadic and rate-based tasks on a real-time multiprocessor. However, task migration is unrestricted under Pfair scheduling. In the worst case, a task may be migrated each time it is scheduled. To correct this problem, we propose to complement initial Pfair scheduling algorithm by some heuristics that strive to minimize the total number of migrations. Experimental simulations are presented to evaluate and compare the proposed heuristics and we show that the number of migrations can be substantially reduced by adding these simple rules.