{'fraction_non_alphanumeric': 0.022968197879858657, 'fraction_numerical': 0.0, 'mean_word_length': 5.593023255813954, '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}}
P_FENP: A Multiprocessor Real-Time Scheduling Algorithm

This paper addresses the problem of real-time scheduling on multiprocessor systems for periodic tasks when scheduling jitter is not allowed. A partitioned real-time scheduling method based on a table-driven uniprocessor algorithm called fixed execution non-preemptive (FENP) is proposed as a solution for this problem. An analysis of the new proposed algorithm is provided in terms of scheduling jitter and schedulability ratio, by comparison against other popular partitioned real-time scheduling algorithms.