International audienceIn this paper, we address the problem of scheduling periodic, possibly self-suspending, real-time tasks. We provide schedulability tests for PFP and EDF and a feasibility test using model checking. This is done both with and without the restriction of work-conserving schedules. We also provide a method to test the sustainability w.r.t the execution and suspension durations of the schedulability and feasibility properties within a restricted interval. Finally we show how to generate an on-line scheduler for such systems when they are feasible
The period enforcer algorithm for self-suspending real-time tasks is a technique for suppressing the...
Abstract: We consider the problem of fixed priority scheduling of non-preemptive strict periodic tas...
Abstract: We propose a model oriented scheduling methodology for highly coupled real time applicatio...
International audienceIn this paper, we address the problem of scheduling periodic, possibly self-su...
International audienceIn this paper, we address the problem of scheduling periodic, possibly self-su...
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...
International audienceIn this paper, we study the global scheduling of periodic task systems on unre...
International audienceThis paper gives and proves correct a simulation interval for any schedule gen...
In computing systems, a job may suspend itself (before it finishes its execution) when it has to wai...
In this paper, we study the global scheduling of periodic task systems on unrelated multiprocessor p...
AbstractWe consider real-time systems in highly safety context where tasks have to meet strict deadl...
<p>Recent trends in System-on-a-Chip show that an increasing number of special-purpose processors ar...
. A theoretical framework is proposed for the verification of complex real-time systems, modeled as ...
: This paper examines a fundamental problem in the theory of real-time scheduling, that of schedulin...
The period enforcer algorithm for self-suspending real-time tasks is a technique for suppressing the...
Abstract: We consider the problem of fixed priority scheduling of non-preemptive strict periodic tas...
Abstract: We propose a model oriented scheduling methodology for highly coupled real time applicatio...
International audienceIn this paper, we address the problem of scheduling periodic, possibly self-su...
International audienceIn this paper, we address the problem of scheduling periodic, possibly self-su...
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...
International audienceIn this paper, we study the global scheduling of periodic task systems on unre...
International audienceThis paper gives and proves correct a simulation interval for any schedule gen...
In computing systems, a job may suspend itself (before it finishes its execution) when it has to wai...
In this paper, we study the global scheduling of periodic task systems on unrelated multiprocessor p...
AbstractWe consider real-time systems in highly safety context where tasks have to meet strict deadl...
<p>Recent trends in System-on-a-Chip show that an increasing number of special-purpose processors ar...
. A theoretical framework is proposed for the verification of complex real-time systems, modeled as ...
: This paper examines a fundamental problem in the theory of real-time scheduling, that of schedulin...
The period enforcer algorithm for self-suspending real-time tasks is a technique for suppressing the...
Abstract: We consider the problem of fixed priority scheduling of non-preemptive strict periodic tas...
Abstract: We propose a model oriented scheduling methodology for highly coupled real time applicatio...