{'fraction_non_alphanumeric': 0.01509433962264151, 'fraction_numerical': 0.0030188679245283017, 'mean_word_length': 5.46829268292683, '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}}
Soft aperiodic task scheduling on hard real-time multiprocessor systems

The problem of jointly scheduling both hard deadline periodic tasks and soft aperiodic tasks has been the subject of considerable research in real-time systems. The main goal of such a system is to minimize the response time of soft aperiodic tasks, without jeopardizing the hard deadlines of periodic tasks. Although, several approaches have been developed to schedule critical workloads on multiprocessors and to manage aperiodic tasks on monoprocessors, the proposed problem has not been fully solved for multiprocessors and integrated solutions are still required. This paper addresses the problem of scheduling an aperiodic workload on a multiprocessor system, where every processor has been previously allocated a critical periodic workload. Such pre-allocated workload is the result of executing a partitioning algorithm in order to ensure the timeliness of the critical workload. Two different approaches are used in order to minimize the response time of the aperiodic workload: aperiodic on-line assignment and global aperiodic scheduling. On highly loaded systems, the results show that the global aperiodic scheduling obtains aperiodic average response times between 20% and 50% lower than those obtained by the on-line assignment approach.