Partitioned scheduling of multimode multiprocessor real-time systems with temporal isolation
Joël Goossens, Pascal Richard · 2013
We consider the partitioned scheduling problem of multi-mode real-time systems upon identical multiprocessor platforms. During the execution of a multimode system, the system can change from one mode to another such that the current task set is replaced with a new one. In this paper, we consider a synchronous transition protocol in order to take into account mode-independent tasks, i.e., tasks of which the execution pattern must not be jeopardized by the mode changes. We propose two methods for handling mode changes in partitioned scheduling. The first approach is an offline/optimal method (i.e., Mixed Integer Linear Programming)and computes a static allocation of tasks schedulable and respecting both tasks and transition deadlines (if any). The second approach is based on an online First Fit allocation and a sufficient schedulability condition in order to satisfy the timing constraints.