Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors

Cucu, Liliana; Goossens, Joël

doi:10.1109/etfa.2006.355388

Cited by 35 publications

(37 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are several periodicity results in [10] concerning constrained deadline systems, on uniform multiprocessor systems, that can be applied to the identical multiprocessor platforms. If the tasks are synchronous, then any feasible schedule generated by a deterministic and memoryless scheduler has a periodic behavior on the interval [0, H), under the assumption that each job of the same task has the same execution time.…”

Section: Multiprocessor Resultsmentioning

confidence: 99%

“…Uniform multiprocessor Unrelated multiprocessor FTP [23] FJP [15] FJP [16] Consv [2,8] Any [26] Any [4] gFTP [11] gFTP [10] gFTP [12] Any Comparison with other existing bounds In Table 1, the main results concerning periodicity are summarized. All the results assume a deterministic and memoryless scheduling algorithm.…”

Section: Uniprocessor Identical Multiprocessormentioning

confidence: 99%

“…Theorem 1 gives a simulation interval [0,8), while the bound given in [11] (see Equation 2) gives [0,24). In this case, since the deadlines are lower than the periods, we could also use the upper bound given in [10] (see Equation 1), and obtain the simulation interval [0, 16). [11], and cannot be calculated with [10], because D 1 > T 1 .…”

Section: Uniprocessor Identical Multiprocessormentioning

confidence: 99%

“…All the results assume a deterministic and memoryless scheduling algorithm. Fig 6 is giving a classification of these results based on a generalization relationship: we see that, except for [10] and [12], our simulation interval can be applied to any context where the other simulation intervals hold. We can note that for identical processors, this research considers the widest area of application: arbitrary deadlines, the widest class of structural constraints ever considered, and any deterministic and memoryless algorithm (including any popular algorithm like fixed-task or fixed-job priority based schedulers, as well as offline methods a.k.a.…”

Section: Uniprocessor Identical Multiprocessormentioning

confidence: 99%

See 3 more Smart Citations

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

Goossens¹,

Grolleau²,

Cucu-Grosjean³

2016

Real-Time Syst

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

Section: Multiprocessor Resultsmentioning

confidence: 99%

Section: Uniprocessor Identical Multiprocessormentioning

confidence: 99%

Section: Uniprocessor Identical Multiprocessormentioning

confidence: 99%

Section: Uniprocessor Identical Multiprocessormentioning

confidence: 99%

See 2 more Smart Citations

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

Goossens¹,

Grolleau²,

Cucu-Grosjean³

2016

Real-Time Syst

View full text Add to dashboard Cite

show abstract

“…Recent studies provide a better understanding of this scheduling problem and provide the first solutions, e.g., [3] presents a categorization of real-time multiprocessor scheduling problems and [7] an up-to-date state of the art. To the best of our knowledge, a single work [1] provides exact schedulability test for the global scheduling of periodic systems on multiprocessors (except two past conference papers we have already published [4,5]). Baker and Cirinei present a test for global preemptive priority-based scheduling of sporadic tasks on identical processors.…”

Section: Introductionmentioning

confidence: 99%

Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms

Cucu-Grosjean

Goossens

2011

Journal of Systems Architecture

View full text Add to dashboard Cite

In this paper, we study the global scheduling of periodic task systems on unrelated multiprocessor platforms. We first show two general properties which are well-known for uniprocessor platforms and which are also true for unrelated multiprocessor platforms:(i) under few and not so restrictive assumptions, we prove that feasible schedules of periodic task systems are periodic starting from some point in time with a period equal to the least common multiple of the task periods and (ii) for the specific case of synchronous periodic task systems, we prove that feasible schedules repeat from their origin. We then present our main result: we characterize, for task-level fixed-priority schedulers and for asynchronous constrained or arbitrary deadline periodic task models, upper bounds of the first time-instant where the schedule repeats. For task-level fixed-priority schedulers, based on the upper bounds and the predictability property, we provide exact schedulability tests for asynchronous constrained or arbitrary deadline periodic task sets. Finally, we provide an exact schedulability test as well for the job-level fixed-priority Earliest Deadline First (EDF) scheduler, for which such an upper bound is unknown.

show abstract

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

2010

View full text Add to dashboard Cite

show abstract

Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors

Cited by 35 publications

References 10 publications

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

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

Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Contact Info

Product

Resources

About