{'fraction_non_alphanumeric': 0.018794048551292093, 'fraction_numerical': 0.0, 'mean_word_length': 5.39, '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}}
Scheduling of embedded real-time systems : a constraint programming approach

For embedded real-time systems, a correct timing behavior must be guaranteed as a result of the design. Therefore, an important part of the design process is the allocation and scheduling of software tasks onto the hardware architecture. However, the various application constraints typically found in embedded systems significantly complicates this task. Furthermore, to be costeffective, the design of an embedded system must often be optimal, in terms of objectives such as cost and performance. In this thesis I have studied how the constraint programming paradigm can be applied to the problem of optimal allocation and scheduling for embedded real-time systems. In particular, this work addresses two major problems that appear in the construction of allocation and scheduling algorithms for such systems. First, it must be possible to model the system accurately enough to allow the expression of real-world constraints. Second, the run-time performance of the allocation and scheduling algorithm must be reasonable for typical applications. This thesis demonstrates that constraint programming offers support for the development of a scheduling framework that provide the necessary features.