HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Preemptive scheduling of dependent periodic tasks modeled by synchronous dataflow graphs

Abstract : Advanced features in modern cars have increased the criti-cality level of embedded applications in automotive. These applications are generally composed of several communicating functions, for which a deterministic data exchanges is crucial. In the industry, applications are designed with high level models such as Matlab/Simulink. They are implemented on an AUTOSAR platform, where they are scheduled with a fixed-priority based Operating System (OS). However, AUTOSAR OS does not directly provide support for deterministic dataflow implementation. In this paper, we present an approach to implement a deterministic dataflow of dependent periodic tasks on pre-emptive fixed-priority based uniprocessor. We consider a multi-periodic system consisting in several dependent real-time tasks modeled by a Synchronous Dataflow Graph. We use the scheduling of the graph to make the dependent tasks set independent. This permits to insure a deterministic dataflow without requiring synchronization mechanisms. In addition, it allows to use the existing scheduling policies for independent tasks. We propose several heuristics which find a scheduling solution in 76 percent of cases and provide a fast method to deal with dependencies in multi-periodic systems .
Document type :
Conference papers
Complete list of metadata

Contributor : Enagnon Klikpo Connect in order to contact the contributor
Submitted on : Monday, January 30, 2017 - 5:37:59 PM
Last modification on : Friday, January 8, 2021 - 5:32:08 PM





Enagnon Cédric Klikpo, Alix Munier-Kordon. Preemptive scheduling of dependent periodic tasks modeled by synchronous dataflow graphs. Real-Time Networks and Systems RTNS, Oct 2016, Brest, France. pp.77 - 86, ⟨10.1145/2997465.2997474⟩. ⟨hal-01449876⟩



Record views