{'fraction_non_alphanumeric': 0.026651216685979143, 'fraction_numerical': 0.0011587485515643105, 'mean_word_length': 5.352941176470588, '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}}
A Self-Organized Scheduling Algorithm for Embedded Real-Time Systems

In this paper, the authors present a self-organized approach for scheduling tasks on processors in embedded real-time systems. For such a mapping, two conflicting objectives have to be optimized: the reliability and the schedule length. Since the scheduling problem is NP-hard, a heuristic algorithm is used to produce schedules achieving different trade-offs between the two objectives. Moreover, a self-organization strategy based on dynamic crowding distance is adopted. This allows a better exploration of the objective space as well as an enhanced solution diversity. The proposed algorithm, reliability schedule length trad-offs algorithm (RSTA), is tested and compared with the popular SPEA2 algorithm where experimental results are promising on both quality and diversity of solutions.