held in conjunction with the 22th Euromicro Intl Conference on Real-Time Systems, July 7-9, 2010, Brussels, BelgiumInternational audienceIn this paper we address the problem of uniprocessor probabilistic scheduling of real-time systems with variable execution times. For these systems the tasks have an associated probability of missing the deadline, i.e., some jobs may miss their deadlines without affecting the schedulability of the system. Therefore dropping these jobs does not affect the schedulability of the system and it could increase the probability of other jobs to meet their deadline. The problem of deciding what jobs to drop is not trivial and we discuss a possible solution
Real-time systems are designed for applications in which response time is critical. As timing is a m...
International audienceThe complexity of modern architectures has increased the timing variability of...
Preemptive scheduling of periodically arriving tasks on a multiprocessor is considered. We show that...
International audienceThe classical model of a real-time system consists of a number of tasks, each ...
International audienceThe classical model of a real-time system consists of a number of tasks, each ...
This paper explores the probability of deadline misses for a set of constrained-deadline sporadic so...
In this paper we present the problem of optimal priority assignments in fixed priority preemptive si...
In Chapter 1 we present our contributionto the scheduling of real-time systems on multiprocessor pla...
Most research in real-time scheduling theory assumes idealized system conditions. The issues that ca...
International audienceThis paper discusses evaluation criteria and scheduling strategies for the ana...
We present the concept of degree of schedulability for mixed-criticality scheduling systems. This co...
AbstractWe survey our research on scheduling aperiodic tasks in real-time systems in order to illust...
International audienceThis paper introduces and assesses novel strategies to schedule firm semi-peri...
In this paper we investigate the problem of calculating the response time distribution for real-time...
International audienceWe investigate the global scheduling of sporadic, implicit deadline, real-time...
Real-time systems are designed for applications in which response time is critical. As timing is a m...
International audienceThe complexity of modern architectures has increased the timing variability of...
Preemptive scheduling of periodically arriving tasks on a multiprocessor is considered. We show that...
International audienceThe classical model of a real-time system consists of a number of tasks, each ...
International audienceThe classical model of a real-time system consists of a number of tasks, each ...
This paper explores the probability of deadline misses for a set of constrained-deadline sporadic so...
In this paper we present the problem of optimal priority assignments in fixed priority preemptive si...
In Chapter 1 we present our contributionto the scheduling of real-time systems on multiprocessor pla...
Most research in real-time scheduling theory assumes idealized system conditions. The issues that ca...
International audienceThis paper discusses evaluation criteria and scheduling strategies for the ana...
We present the concept of degree of schedulability for mixed-criticality scheduling systems. This co...
AbstractWe survey our research on scheduling aperiodic tasks in real-time systems in order to illust...
International audienceThis paper introduces and assesses novel strategies to schedule firm semi-peri...
In this paper we investigate the problem of calculating the response time distribution for real-time...
International audienceWe investigate the global scheduling of sporadic, implicit deadline, real-time...
Real-time systems are designed for applications in which response time is critical. As timing is a m...
International audienceThe complexity of modern architectures has increased the timing variability of...
Preemptive scheduling of periodically arriving tasks on a multiprocessor is considered. We show that...