Scheduling Multi-Mode Real-Time Systems upon Uniform Multiprocessor Platforms

TL;DR

This paper introduces scheduling protocols and schedulability tests for multi-mode real-time systems on uniform multiprocessor platforms, providing bounds on transition phases for different priority knowledge scenarios.

Contribution

It proposes two transition protocols with associated schedulability tests and offers upper bounds on transition phase lengths for uniform multiprocessor platforms.

Findings

Two transition protocols with schedulability tests

Upper bounds for transient phase lengths

Protocols applicable to systems with known and unknown job priorities

Abstract

In this paper, we address the scheduling problem of multi-mode real-time systems upon uniform multiprocessor platforms. We propose two transition protocols, specified together with their schedulability test, and provide the reader with two distinct upper bounds for the length of the transient phases during mode transitions, respectively for the cases where jobs priorities are known and unknown beforehand.