A scheduling policy or a schedulability test is defined to be sustainable if any task system determined to be schedulable remains so if it behaves ‘‘better’ ’ than mandated by its system specifications. We provide a formal definition of sustainability, and subject the concept to systematic analysis in the context of the uniprocessor scheduling of periodic and sporadic task systems. We argue that it is, in general, preferable engineering practice to use sustainable tests if possible, and classify common uniprocessor schedulability tests according to whether they are sustainable or not
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a...
The multiprocessor Deadline-Monotonic (DM) schedul-ing of sporadic task systems is studied. A new su...
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a...
Motivated by an apparent contradiction regarding whether certain scheduling policies are sustainable...
Motivated by an apparent contradiction regarding whether certain scheduling policies are sustainable...
Sustainability is a formalization of the requirement for scheduling algorithms and schedulability te...
This paper provides an exact and sustainable schedulability test for a set of non-preemptive jobs sc...
In this paper, we address the problem of schedulability analysis of a set of real-time periodic (or ...
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems sch...
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems sch...
This work makes significant contributions in the field of sufficient schedulability tests for rate-m...
This paper addresses the schedulability problem of periodic and sporadic real-time task sets with co...
Slides available at url http://www.loria.fr/~nnavetInternational audienceIn real-time systems, sched...
A real time system is a system that must satisfy explicit bounded response-time constraints, otherwi...
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task...
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a...
The multiprocessor Deadline-Monotonic (DM) schedul-ing of sporadic task systems is studied. A new su...
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a...
Motivated by an apparent contradiction regarding whether certain scheduling policies are sustainable...
Motivated by an apparent contradiction regarding whether certain scheduling policies are sustainable...
Sustainability is a formalization of the requirement for scheduling algorithms and schedulability te...
This paper provides an exact and sustainable schedulability test for a set of non-preemptive jobs sc...
In this paper, we address the problem of schedulability analysis of a set of real-time periodic (or ...
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems sch...
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems sch...
This work makes significant contributions in the field of sufficient schedulability tests for rate-m...
This paper addresses the schedulability problem of periodic and sporadic real-time task sets with co...
Slides available at url http://www.loria.fr/~nnavetInternational audienceIn real-time systems, sched...
A real time system is a system that must satisfy explicit bounded response-time constraints, otherwi...
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task...
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a...
The multiprocessor Deadline-Monotonic (DM) schedul-ing of sporadic task systems is studied. A new su...
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a...