When developing multitasking real-time systems, schedulability tests are used to formally prove that a given task set will meet its deadlines. A wide range of such tests have appeared in the literature. This tutorial acts as a guide to the major tests available for preemptive multitasking applications
Abstract—Real-time scheduling is the theoretical basis of real-time systems engineering. Earliest De...
In this thesis it is investigated, how the schedulability of a set of tasks can be analyzed in an ef...
We study the schedulability analysis problem for nonpreemptive scheduling algorithms on multiprocess...
When developing multitasking real-time systems, schedulability tests are used to formally prove that...
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic sch...
A schedulability test is presented for preemptive deadline scheduling of periodic or sporadic real-t...
In this paper, we address the problem of schedulability analysis of a set of real-time periodic (or ...
With increasing popularity and deployment of multi-core chips in embedded systems, a number of real-...
A new feasibility test for preemptive scheduling of periodic or sporadic real-time tasks on a single...
International audienceIn this paper we provide a schedulability test for dependant periodic task sys...
Exact schedulability analysis of limited-preemptive (or non-preemptive) real-time workloads with var...
We provide four new schedulability tests for a scheduling model according to which there is a high p...
Abstract In this paper, we study schedulability analysis problems for multi-processor real-time syst...
Systems in many safety-critical application domains are subject to certification requirements. In su...
We show how real-time schedulability tests and program refinement rules can be integrated to create ...
Abstract—Real-time scheduling is the theoretical basis of real-time systems engineering. Earliest De...
In this thesis it is investigated, how the schedulability of a set of tasks can be analyzed in an ef...
We study the schedulability analysis problem for nonpreemptive scheduling algorithms on multiprocess...
When developing multitasking real-time systems, schedulability tests are used to formally prove that...
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic sch...
A schedulability test is presented for preemptive deadline scheduling of periodic or sporadic real-t...
In this paper, we address the problem of schedulability analysis of a set of real-time periodic (or ...
With increasing popularity and deployment of multi-core chips in embedded systems, a number of real-...
A new feasibility test for preemptive scheduling of periodic or sporadic real-time tasks on a single...
International audienceIn this paper we provide a schedulability test for dependant periodic task sys...
Exact schedulability analysis of limited-preemptive (or non-preemptive) real-time workloads with var...
We provide four new schedulability tests for a scheduling model according to which there is a high p...
Abstract In this paper, we study schedulability analysis problems for multi-processor real-time syst...
Systems in many safety-critical application domains are subject to certification requirements. In su...
We show how real-time schedulability tests and program refinement rules can be integrated to create ...
Abstract—Real-time scheduling is the theoretical basis of real-time systems engineering. Earliest De...
In this thesis it is investigated, how the schedulability of a set of tasks can be analyzed in an ef...
We study the schedulability analysis problem for nonpreemptive scheduling algorithms on multiprocess...
DOI
Add to ORKG