• search hit 5 of 35
Back to Result List

Partly Proportionate Fair Multiprocessor Scheduling of Heterogeneous Task Systems

  • Proportionate fair (Pfair) scheduling, which allows task migration at runtime and assigns each task processing time with regard to its weight, is one of the most efficient group of SMP multiprocessor scheduling algorithms known up to now. Drawbacks are tight requirements to the task system, namely the restriction to periodic task systems with synchronized task activation, quantized task execution time, and implicit task deadline. Most likely, a typical embedded real-time system does not fulfill these requirements. In this paper we address violations of these requirements. For heterogeneous task systems, we define the multiple time base (MTB) task system, which is a less pessimistic model than sporadic task systems and is used for automotive systems. We apply the concept of Pfair scheduling to MTB task systems, called partly proportionate fair (Partly-Pfair) scheduling. The restrictions on MTB task systems required for Partly-Pfair ness are weaker than restrictions on periodic task systems required for Pfair ness. In a simulation based study we examined the performance of Partly-Pfair-PD and found it capable to schedule feasible MTB task sets causing a load of up to 100% of the system capacity.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Metadaten
Author:Michael Deubzer, Ulrich Margull, Jürgen MottokORCiDGND, Michael NiemetzORCiDGND, Gerhard Wirrer
Parent Title (English):5th Embedded Real Time Software and Systems Conference, May 2010
Document Type:conference proceeding (article)
Language:English
Year of first Publication:2010
Release Date:2021/03/05
Institutes:Fakultät Elektro- und Informationstechnik
Fakultät Elektro- und Informationstechnik / Labor Datenkommunikation
Fakultät Elektro- und Informationstechnik / Laboratory for Safe and Secure Systems (LAS3)
research focus:Digitalisierung