Partitioned scheduling of multimode multiprocessor real-time systems with temporal isolation

TL;DR

This paper addresses the challenge of partitioned scheduling in multimode multiprocessor real-time systems, proposing methods for static and online task allocation to ensure temporal isolation during mode transitions.

Contribution

It introduces two novel approaches for handling mode changes in partitioned scheduling, including an optimal offline method and a sufficient condition for online allocation.

Findings

The offline method guarantees schedulability and deadline adherence.

The online approach ensures timely task allocation with First Fit.

Both methods improve mode transition management in multiprocessor systems.

Abstract

We consider the partitioned scheduling problem of multimode 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 method is offline/optimal and computes a static allocation of tasks schedulable and respecting both tasks and transition deadlines (if any). The second approach is subject to a sufficient condition in order to ensure online First Fit based allocation to satisfy the timing constraints.