Buffer Minimization in Earliest-Deadline First Scheduling of Dataflow Graphs

Adnan Bouakaz 1, * Jean-Pierre Talpin 1
* Auteur correspondant
1 ESPRESSO - Synchronous programming for the trusted component-based engineering of embedded systems and mission-critical systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Symbolic schedulability analysis of dataflow graphs is the process of synthesizing the timing parameters (i.e. periods, phases, and deadlines) of actors so that the task system is schedulable and achieves a high throughput when using a specific scheduling policy. Furthermore, the resulted schedule must ensure that communication buffers are underflow- and overflow-free. This paper describes a (partitioned) earliest -deadline first symbolic schedulability analysis of dataflow graphs that minimizes the buffering requirements. Our scheduling analysis consists of three major steps. (1) The construction of an abstract affine schedule of the graph that excludes overflow and underflow exceptions and minimizes the buffering requirements assuming some precedences between jobs. (2) Symbolic deadlines adjustment that guarantees precedences without the need for lock-based synchronizations. (3) The concretization of the affine schedule using a symbolic, fast-converging, processor-demand analysis for both uniprocessor and multiprocessor systems. Experimental results show that our technique improves the buffering requirements in many cases.
Type de document :
Communication dans un congrès
ACM SIG- PLAN/SIGBED conference on languages, compilers and tools for embedded systems, Jun 2013, Seattle, WA, United States. 48, pp.133-142, 2013, 〈10.1145/2499369.2465558〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00916485
Contributeur : Adnan Bouakaz <>
Soumis le : mardi 10 décembre 2013 - 12:41:55
Dernière modification le : mercredi 16 mai 2018 - 11:23:02

Identifiants

Citation

Adnan Bouakaz, Jean-Pierre Talpin. Buffer Minimization in Earliest-Deadline First Scheduling of Dataflow Graphs. ACM SIG- PLAN/SIGBED conference on languages, compilers and tools for embedded systems, Jun 2013, Seattle, WA, United States. 48, pp.133-142, 2013, 〈10.1145/2499369.2465558〉. 〈hal-00916485〉

Partager

Métriques

Consultations de la notice

228