Probabilistic Schedulability Analysis for Real-time Tasks with Precedence Constraints on Partitioned Multi-core - Archive ouverte HAL Access content directly
Conference Papers Year :

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

(1) , (1) , (1) , (1)
1

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.
Fichier principal
Vignette du fichier
ISORC_2020__wip_(Slim BEN AMOR).pdf (200.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03119186 , version 1 (25-01-2021)

Identifiers

Cite

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⟩

Collections

INRIA INRIA2
62 View
53 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More