Minimizing the cardinality of a real-time task set by automated task clustering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Minimizing the cardinality of a real-time task set by automated task clustering

Abstract

The objective of this paper is first to properly define the notion of task clustering. This is the process of automatically mapping functionalities (blocks of code corresponding to a high-level feature) with real-time constraints to tasks (or threads). We aim at reducing the number of tasks functionalities are mapped to, while preserving the schedulability of the initial system. Second, our goal is to expose the complexity of the problem and to sketch methods we will propose for solving this problem. We consider independent tasks running on a single processor.
Fichier principal
Vignette du fichier
jrwrtc2013_paper_3.pdf (186.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00874979 , version 1 (20-10-2013)

Identifiers

  • HAL Id : hal-00874979 , version 1

Cite

Antoine Bertout, Julien Forget, Richard Olejnik. Minimizing the cardinality of a real-time task set by automated task clustering. Proceedings of the 7th Junior Researcher Workshop on Real-Time Computing (JRWRTC 2013), Oct 2013, Sophia Antipolis, France. pp.9-12. ⟨hal-00874979⟩
474 View
150 Download

Share

Gmail Facebook X LinkedIn More