Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks

Baker, Theodore P.; Cirinei, Michele

doi:10.1007/978-3-540-77096-1_5

“…With regards to sufficient schedulability tests for global DM scheduling 3 , a test was presented in [17] for determining whether a given sporadic task system is global-DM schedulable upon a preemptive multiprocessor platform comprised comprised of m unit-capacity processors. It was shown that the processor speedup factor for this global-DM schedulability test is at most (4 − 1 m ), when implemented upon m-processor platforms.…”

Section: Prior Resultsmentioning

confidence: 99%

Techniques for Multiprocessor Global Schedulability Analysis

Vestal

¹

2007

28th IEEE International Real-Time Systems Symposium (RTSS 2007)

View full text Add to dashboard Cite

A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is generalized so that it is applicable to the schedulability analysis of realtime systems scheduled on multiprocessor platforms by any work-conserving algorithm. The resulting analysis technique is applied to obtain a new sufficient global Deadline Monotonic (DM) schedulability test. It is shown that this new test is quantitatively superior to pre-existing DM schedulability analysis tests; in addition, the degree of its deviation from any hypothetical optimal scheduler (that may be clairvoyant) is quantitatively bounded. A new global EDF schedulability test is also proposed here that builds on the results of Bonifaci et al. This new test is shown to be less pessimistic and more widely applicable than the earlier result was, while retaining the strong theoretical properties of the earlier result.

show abstract

“…No exact schedulability tests are known, of any computational complexity, for the global EDF and DM scheduling of sporadic task systems (although an exact test of unacceptably high computational complexity, based on brute force state-space search, has been proposed [3] for EDF, for the special case when all task parameters are restricted to be integers). A number of sufficient schedulability tests have been proposed, including [1, 4, 8-10, 14, 18] -see [12] for a fairly comprehensive survey.…”

Section: Introductionmentioning

confidence: 99%

Improved multiprocessor global schedulability analysis

Baruah

¹

,

Bonifaci

²

,

Marchetti-Spaccamela

³

et al. 2010

View full text Add to dashboard Cite

A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is generalized so that it is applicable to the schedulability analysis of realtime systems scheduled on multiprocessor platforms by any work-conserving algorithm. The resulting analysis technique is applied to obtain a new sufficient global Deadline Monotonic (DM) schedulability test. It is shown that this new test is quantitatively superior to pre-existing DM schedulability analysis tests; in addition, the degree of its deviation from any hypothetical optimal scheduler (that may be clairvoyant) is quantitatively bounded. A new global EDF schedulability test is also proposed here that builds on the results of Bonifaci et al. This new test is shown to be less pessimistic and more widely applicable than the earlier result was, while retaining the strong theoretical properties of the earlier result.

show abstract

“…For example, schedulability of sporadic tasks systems on identical multiprocessor platforms is addressed in [3], which is explicitely storing and exploring the search space of every possible simulation based on every possible release date of every job. The storage of every state is required in order to find a cycle by comparing every new state to the previously built states.…”

Section: Using Simulation As a Schedulability Testmentioning

confidence: 99%

Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms

Goossens¹,

Grolleau²,

2016

View full text Add to dashboard Cite

This paper gives and proves correct a simulation interval for any schedule generated by a deterministic and memoryless scheduler (i.e., one where the scheduling decision is the same and unique for any two identical system states) for identical multiprocessor platforms. We first consider independent periodic tasks, then generalize the simulation interval to tasks sharing critical resources, and subject to precedence constraints or self-suspension. The simulation interval is based only on the periods, release times and deadlines, and is independent from any other parameters. It is proved large enough to cover any feasible schedule produced by any deterministic and memoryless scheduler on multiprocessor platforms, including non conservative schedulers. To the best of our knowledge, this simulation interval covers the largest class of tasks systems and scheduling algorithms on identical multiprocessor platforms ever studied. This simulation interval is used to derive a simulation algorithm using a linear space complexity. Finally, a generic exact schedulability test based on simulation is presented. This test can be applied only when sustainability is consistent with online variability of the tasks' parameters.

show abstract

Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks

Cited by 51 publications

References 7 publications

Techniques for Multiprocessor Global Schedulability Analysis

Techniques for Multiprocessor Global Schedulability Analysis

Improved multiprocessor global schedulability analysis

Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms

Contact Info

Product

Resources

About