Multiprocessor Scheduling of Precedence-constrained Mixed-Critical Jobs

Dario Socci (1) , Peter Poplavko (1) , Saddek Bensalem (1) , Marius Bozga (1)

1 VERIMAG - IMAG - VERIMAG

The real-time system design targeting multiprocessor platforms leads to two important complications in real-time scheduling. First, to ensure deterministic processing by communicating tasks the scheduling has to consider precedence constraints. The second complication factor is mixed criticality, i.e., integration upon a single platform of various subsystems where some are safety-critical (e.g., car braking system) and the others are not (e.g., car digital radio). Therefore we motivate and study the multiprocessor scheduling problem of a finite set of precedence-related mixed criticality jobs. This problem, to our knowledge, has never been studied if not under very specific assumptions. The main contribution of our work is an algorithm that, given a global fixed-priority assignment for jobs, can modify it in order to improve its schedulability for mixed-criticality setting. Our experiments show an increase of schedulable instances up to a maximum of 25% if compared to classical solutions for this category of scheduling problems.

Domaines: Systèmes embarqués

Dario Socci, Peter Poplavko, Saddek Bensalem, Marius Bozga. Multiprocessor Scheduling of Precedence-constrained Mixed-Critical Jobs. IEEE 18th International Symposium on Real-Time Distributed Computing, ISORC 2015, Apr 2015, Auckland, New Zealand. pp.198--207, ⟨10.1109/ISORC.2015.18⟩. ⟨hal-01212339⟩