National audienceOur study is devoted to the evaluation of schedules of parallel applications consisting of a set of stochastic tasks having precedence constraints between them. This is an important issue when the goal is to evaluate the efficiency and the robustness of a schedule. In this case, evaluating the makespan consists to evaluate an arithmetic expression with random variables. Results show that our proposed method provides a reasonable trade-off between precision and computation time
Exact stochastic analysis of most real-time systems under preemptive priority-driven scheduling is u...
New programming models have been proposed to exploit the parallelism of modern computing architectur...
Real-time systems increasingly contain processing units with multiple cores. To use this additional ...
This study is devoted to the evaluation of schedules of parallel applications consisting of a set of...
We obtain stochastic bounds on execution times of parallel computations assuming ideal conditions fo...
International audienceThe scheduling of parallel real-time tasks on multiprocessor systems is more c...
Tasks executing on general purpose multiprocessor platforms exhibit variations in their execution ti...
International audienceIn this paper, we analyze the robustness of 20 static, makespan-centric, DAG s...
International audienceThe scheduling of real-time parallel tasks on multiprocessor systems is more c...
This paper describes an algorithm to determine the performance of real-time systems with tasks using...
Most recurrent real-time applications can be modeled as a set of sequential code segments (or blocks...
Most recurrent real-time applications can be modeled as a set of sequential code segments (or blocks...
Exact stochastic analysis of most real-time systems under preemptive priority-driven scheduling is u...
New programming models have been proposed to exploit the parallelism of modern computing architectur...
Real-time systems increasingly contain processing units with multiple cores. To use this additional ...
This study is devoted to the evaluation of schedules of parallel applications consisting of a set of...
We obtain stochastic bounds on execution times of parallel computations assuming ideal conditions fo...
International audienceThe scheduling of parallel real-time tasks on multiprocessor systems is more c...
Tasks executing on general purpose multiprocessor platforms exhibit variations in their execution ti...
International audienceIn this paper, we analyze the robustness of 20 static, makespan-centric, DAG s...
International audienceThe scheduling of real-time parallel tasks on multiprocessor systems is more c...
This paper describes an algorithm to determine the performance of real-time systems with tasks using...
Most recurrent real-time applications can be modeled as a set of sequential code segments (or blocks...
Most recurrent real-time applications can be modeled as a set of sequential code segments (or blocks...
Exact stochastic analysis of most real-time systems under preemptive priority-driven scheduling is u...
New programming models have been proposed to exploit the parallelism of modern computing architectur...
Real-time systems increasingly contain processing units with multiple cores. To use this additional ...