Self-timed periodic scheduling for a cyclo-static dataflow model

Abstract : Real-time and time-constrained applications programmed on many-core systems can suffer from unmet timing constraints even with correct-by-construction schedules. Such unexpected results are usually caused by unaccounted for delays due to resource sharing (e.g. the communication medium). In this paper we address the three main sources of unpredictable behaviors: First, we propose to use a deterministic Model of Computation (MoC), more specifically, the well-formed CSDF subset of process networks; Second, we propose a run-time management strategy of shared resources to avoid unpredictable timings; Third, we promote the use of a new scheduling policy, the so-said Self-Timed Periodic (STP) scheduling, to improve performance and decrease synchronization costs by taking into account resource sharing or resource constraints. This is a quantitative improvement above state-of-the-art scheduling policies which assumed fixed delays of inter-processor communication and did not take correctly into account subtle effects of synchronization.
Document type :
Journal articles
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal-cea.archives-ouvertes.fr/cea-01831558
Contributor : Léna Le Roy <>
Submitted on : Friday, July 6, 2018 - 10:17:27 AM
Last modification on : Thursday, October 24, 2019 - 2:44:12 PM
Long-term archiving on: Tuesday, October 2, 2018 - 5:26:26 AM

File

Dkhil et al, 2014.pdf
Publisher files allowed on an open archive

Licence


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License

Identifiers

Collections

Citation

A. Dkhil, X.K. Do, P. Dubrulle, S. Louise, C. Rochange. Self-timed periodic scheduling for a cyclo-static dataflow model. Procedia Computer Science, Elsevier, 2014, 29, pp.1134-1145. ⟨10.1016/j.procs.2014.05.102⟩. ⟨cea-01831558⟩

Share

Metrics

Record views

74

Files downloads

108