Affine Data-Flow Graphs for the Synthesis of Hard Real-Time Applications

Abstract : Data-flow models ease the task of constructing feasible schedules of computations and communications of high-assurance embedded applications. One key and open issue is how to schedule data-flow graphs so as to minimize the buffering of data and reduce end-to-end latency. Most of the proposed techniques in that respect are based on either static or data-driven scheduling. This paper looks at the problem in a different way by considering priority-driven preemptive scheduling theory of periodic tasks to execute a data-flow program. Our approach to the problem can be detailed as follows. (1) We propose a model of computation in which the activation clocks of actors are related by affine functions. The affine relations describe the symbolic scheduling constraints of the data-flow graph. (2) Based on this framework, we present an algorithm that computes affine schedules in a way that minimizes buffering requirements and, in addition, guarantees the absence of overflow and underflow exceptions over communication channels. (3) Depending on the chosen scheduling policy (earliest-deadline first or rate-monotonic), we concretize the symbolic schedule by defining the period and the phase of each actor. This concretization guarantees schedulability and maximizes the processor utilization factor.
Type de document :
Communication dans un congrès
Proceedings of the 2012 12th International Conference on Application of Concurrency to System Design, Jun 2012, Hamburg, Germany. ACM, pp.183-192, 2012, 〈10.1109/ACSD.2012.16〉
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00763387
Contributeur : Thierry Gautier <>
Soumis le : lundi 10 décembre 2012 - 16:27:09
Dernière modification le : mercredi 11 avril 2018 - 01:51:18
Document(s) archivé(s) le : lundi 11 mars 2013 - 12:45:47

Fichier

acsd12.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Adnan Bouakaz, Jean-Pierre Talpin, Jan Vitek. Affine Data-Flow Graphs for the Synthesis of Hard Real-Time Applications. Proceedings of the 2012 12th International Conference on Application of Concurrency to System Design, Jun 2012, Hamburg, Germany. ACM, pp.183-192, 2012, 〈10.1109/ACSD.2012.16〉. 〈hal-00763387〉

Partager

Métriques

Consultations de la notice

292

Téléchargements de fichiers

293