DeepAI AI Chat
Log In Sign Up

Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems

by   Jian-Jia Chen, et al.

The sporadic task model is often used to analyze recurrent execution of identical tasks in real-time systems. A sporadic task defines an infinite sequence of task instances, also called jobs, that arrive under the minimum inter-arrival time constraint. To ensure the system safety, timeliness has to be guaranteed in addition to functional correctness, i.e., all jobs of all tasks have to be finished before the job deadlines. We focus on analyzing arbitrary-deadline task sets on a homogeneous (identical) multiprocessor system under any given global fixed-priority scheduling approach and provide a series of schedulability tests with different tradeoffs between their time complexity and their accuracy. Under the arbitrary-deadline setting, the relative deadline of a task can be longer than the minimum inter-arrival time of the jobs of the task. We show that global deadline-monotonic (DM) scheduling has a speedup bound of 3-1/M against any optimal scheduling algorithms, where M is the number of identical processors, and prove that this bound is asymptotically tight.


page 1

page 2

page 3

page 4


EDF-Like Scheduling for Self-Suspending Real-Time Tasks

In real-time systems, schedulability tests are utilized to provide timin...

Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms

Algorithms based on semi-partitioned scheduling have been proposed as a ...

Gang FTP scheduling of periodic and parallel rigid real-time tasks

In this paper we consider the scheduling of periodic and parallel rigid ...

Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model

A model has been proposed in [Baruah et al., in Proceedings of the IEEE ...

Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems

In real-time systems, in addition to the functional correctness recurren...

Optimal Divisible Load Scheduling for Resource-Sharing Network

Scheduling is an important task allowing parallel systems to perform eff...

Analysis of Global Fixed-Priority Scheduling for Generalized Sporadic DAG Tasks

We consider global fixed-priority (G-FP) scheduling of parallel tasks, i...