Invited PaperInternational audienceWe show how to evaluate the performance of solutions to finite-horizon scheduling problems where task durations are specified by bounded uniform distributions. Our computational technique, based on computing the volumes of zones, constitutes a contribution to the computational study of scheduling under uncertainty and stochastic systems in general
In this work, we deal with fixed interval scheduling problems with the possibility of random delay o...
International audienceThe classical model of a real-time system consists of a number of tasks, each ...
Exact stochastic analysis of most real-time systems under preemptive priority-driven scheduling is u...
Abstract. We show how to evaluate the performance of solutions to finite-horizon scheduling problems...
In this paper, we describe an approach to scheduling under uncertainty that achieves scalability thr...
Proactive approaches to scheduling take into account information about the execution time uncertaint...
Most classical scheduling formulations assume a fixed and known duration for each ac-tivity. In this...
Classical analysis of real-time systems focuses on guaranteeing the schedulability of the system whe...
This thesis consists in revisiting traditional scheduling problematics in computational environments...
Most classical scheduling formulations assume a fixed and known duration for each activity. In this ...
We investigate analytical cost distributions in the setting of a dynamic stochastic scheduling probl...
Quite often transportation companies face two types of jobs, ones which they can plan themselves and...
This paper describes an algorithm to determine the performance of real-time systems with tasks using...
International audienceThe classical model of a real-time system consists of a number of tasks, each ...
We propose an extension of the zone-based algorithmics for analyzing timed automata to handle system...
In this work, we deal with fixed interval scheduling problems with the possibility of random delay o...
International audienceThe classical model of a real-time system consists of a number of tasks, each ...
Exact stochastic analysis of most real-time systems under preemptive priority-driven scheduling is u...
Abstract. We show how to evaluate the performance of solutions to finite-horizon scheduling problems...
In this paper, we describe an approach to scheduling under uncertainty that achieves scalability thr...
Proactive approaches to scheduling take into account information about the execution time uncertaint...
Most classical scheduling formulations assume a fixed and known duration for each ac-tivity. In this...
Classical analysis of real-time systems focuses on guaranteeing the schedulability of the system whe...
This thesis consists in revisiting traditional scheduling problematics in computational environments...
Most classical scheduling formulations assume a fixed and known duration for each activity. In this ...
We investigate analytical cost distributions in the setting of a dynamic stochastic scheduling probl...
Quite often transportation companies face two types of jobs, ones which they can plan themselves and...
This paper describes an algorithm to determine the performance of real-time systems with tasks using...
International audienceThe classical model of a real-time system consists of a number of tasks, each ...
We propose an extension of the zone-based algorithmics for analyzing timed automata to handle system...
In this work, we deal with fixed interval scheduling problems with the possibility of random delay o...
International audienceThe classical model of a real-time system consists of a number of tasks, each ...
Exact stochastic analysis of most real-time systems under preemptive priority-driven scheduling is u...