An abstraction-refinement framework for priority-driven scheduling of static dataflow graphs

Adnan Bouakaz 1 Thierry Gautier 2
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
2 TEA - Tim, Events and Architectures
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : Static dataflow graphs are widely used to model concurrent real-time streaming applications. Though the state of the art usually advocates static-periodic scheduling of dataflow graphs over dynamic scheduling, the interest in dynamic (for instance, priority-driven) scheduling of dataflow graphs has been rekindled by the increasing use of virtualization technology and real-time operating systems to manage concurrent independent applications running on the same platform. This paper presents a sequence-based framework in which a large class of priority-driven schedules of dataflow graphs can be uniformly expressed and analyzed. Constructed schedules should be buffer-safe (i.e. no overflow/underflow exceptions over communication channels) even in the worst-case admission scenario of incoming applications and tasks. In addition, and to our knowledge for the first time, the paper formulates this scheduling theory in abstraction-refinement framework, to allow for the construction of feasible and buffer-safe priority-driven schedules based on mathematically sound approximations of physical time in priority-driven schedules.
Type de document :
Communication dans un congrès
International Conference on Formal Methods and Models for System Design, Oct 2014, Lausanne, Switzerland. IEEE Press, 2014, 2014 Twelfth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE). 〈http://memocode-conference.com〉. 〈10.1109/MEMCOD.2014.6961838〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01088205
Contributeur : Adnan Bouakaz <>
Soumis le : jeudi 27 novembre 2014 - 15:35:57
Dernière modification le : mercredi 16 mai 2018 - 11:24:07

Identifiants

Citation

Adnan Bouakaz, Thierry Gautier. An abstraction-refinement framework for priority-driven scheduling of static dataflow graphs. International Conference on Formal Methods and Models for System Design, Oct 2014, Lausanne, Switzerland. IEEE Press, 2014, 2014 Twelfth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE). 〈http://memocode-conference.com〉. 〈10.1109/MEMCOD.2014.6961838〉. 〈hal-01088205〉

Partager

Métriques

Consultations de la notice

266