Skip to Main content Skip to Navigation
Conference papers

Probabilistic Schedulability Analysis for Real-time Tasks with Precedence Constraints on Partitioned Multi-core

Abstract : The design of embedded systems is facing the explosion of new functionalities requiring increased computation capacities and, thus, the introduction of multi-core processors. Moreover, some functionalities may impose precedence constraints between the programs implementing them. In this paper, we consider partitioned scheduling of tasks with precedence constraints defined by multiple Directed Acyclic Graphs (DAGs). The variability of execution and communication times is taken into account by describing them with probability distributions. Our probabilistic response time analysis is validated on random generated task sets and on a PX4 drone autopilot.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-03119186
Contributor : Slim Ben Amor Connect in order to contact the contributor
Submitted on : Monday, January 25, 2021 - 2:11:34 PM
Last modification on : Tuesday, January 11, 2022 - 11:16:07 AM
Long-term archiving on: : Monday, April 26, 2021 - 7:03:56 PM

File

ISORC_2020__wip_(Slim BEN AMOR...
Files produced by the author(s)

Identifiers

Collections

Citation

Slim Ben-Amor, Liliana Cucu-Grosjean, Mehdi Mezouak, Yves Sorel. Probabilistic Schedulability Analysis for Real-time Tasks with Precedence Constraints on Partitioned Multi-core. ISORC 2020 - IEEE 23rd International Symposium on Real-Time Distributed Computing, May 2020, Nashville / Virtual, United States. pp.142-143, ⟨10.1109/ISORC49007.2020.00029⟩. ⟨hal-03119186⟩

Share

Metrics

Les métriques sont temporairement indisponibles