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

04/21/2010

∙

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.

READ FULL TEXT

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

Global Scheduling of Multi-Mode Real-Time Applications upon Multiprocessor Platforms

Mode Change Protocol for Multi-Mode Real-Time Systems upon Identical Multiprocessors

Modeling, Analysis, and Hard Real-time Scheduling of Adaptive Streaming Applications

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

Multi-Rate Fluid Scheduling of Mixed-Criticality Systems on Multiprocessors

Efficiently Approximating the Probability of Deadline Misses in Real-Time Systems

Continuous-Time Formulations for Multi-Mode Project Scheduling

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

Related Research

Global Scheduling of Multi-Mode Real-Time Applications upon Multiprocessor Platforms

Mode Change Protocol for Multi-Mode Real-Time Systems upon Identical Multiprocessors

Modeling, Analysis, and Hard Real-time Scheduling of Adaptive Streaming Applications

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

Multi-Rate Fluid Scheduling of Mixed-Criticality Systems on Multiprocessors

Efficiently Approximating the Probability of Deadline Misses in Real-Time Systems

Continuous-Time Formulations for Multi-Mode Project Scheduling