Partly Proportionate fair (Partly-Pfair) scheduling, which allows task migration at runtime and assigns each task processing time with regard to its weight, makes it possible to build highly efficient embedded multi-core systems. Due to its non-work-conserving behaviour, which might leave the CPU idle even when tasks are ready to execute, tasks finish only shortly before their deadlines are reached. Benefits are lower task jitter, but additional workload, e.g. through interrupts, can lead to deadline violations. In this paper the authors present a work-conserving extension of Partly-Pfair scheduling, called PERfair scheduling and the algorithm P-ERfair-PI which applies Pfair modifications used for Partly-Pfair on the concept of ERfairness and PI policies. With a simulation based schedulability examination we show for multiple time base (MTB) task sets that P-ERfak-PJ has the same performance as Partly-Pfair-PJ. Additionally, we show that P-ERfair-PD2 has a much higher robustness against perturbations, and therefore it is well suited for embedded domains, especially for the Automotive domain.
Efficient scheduling of reliable automotive multi-core systems with PD2 by weakening ERfair task system requirements
Effizientes Betriebssystem für ein zuverlässiges Mehrkernsystem in Fahrzeugen mit PD2 bei abgemagerten ERfair Anforderungen an Systemaufgaben
2010
15 Seiten, 3 Bilder, 20 Quellen
Aufsatz (Konferenz)
Englisch
Reliable Real-Time Message Scheduling in Automotive Cyber-Physical Systems
Springer Verlag | 2023
|Tool-based development of efficient automotive multi-core systems
Springer Verlag | 2019
|