Exact Schedulability Test for global-EDF Scheduling of Periodic Hard Real-Time Tasks on Identical Multiprocessors

12/29/2010
by   Joël Goossens, et al.
0

In this paper we consider the scheduling problem of hard real-time systems composed of periodic constrained-deadline tasks upon identical multiprocessor platforms. We assume that tasks are scheduled by using the global-EDF scheduler. We establish an exact schedulability test for this scheduler by exploiting on the one hand its predictability property and by providing on the other hand a feasibility interval so that if it is possible to find a valid schedule for all the jobs contained in this interval, then the whole system will be stamped feasible. In addition, we show by means of a counterexample that the feasibility interval, and thus the schedulability test, proposed by Leung [Leung 1989] is incorrect and we show which arguments are actually incorrect.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2010

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

Algorithms based on semi-partitioned scheduling have been proposed as a ...
research
05/16/2013

On the periodic behavior of real-time schedulers on identical multiprocessor platforms

This paper is proposing a general periodicity result concerning any dete...
research
01/25/2010

On the Design of an Optimal Multiprocessor Real-Time Scheduling Algorithm under Practical Considerations (Extended Version)

This research addresses the multiprocessor scheduling problem of hard re...
research
05/25/2011

A faster exact multiprocessor schedulability test for sporadic tasks

Baker and Cirinei introduced an exact but naive algorithm, based on solv...
research
06/14/2010

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

In this paper we consider the scheduling of periodic and parallel rigid ...
research
12/18/2007

Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms

In this paper, we address the power-aware scheduling of sporadic constra...
research
10/19/2018

Flow Network Models for Online Scheduling Real-time Tasks on Multiprocessors

We consider the flow network model to solve the multiprocessor real-time...

Please sign up or login with your details

Forgot password? Click here to reset