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

Citations of this article
Mendeley users who have this article in their library.


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. © The Authors. Published by Elsevier B.V.




Dkhil, A., Do, X. K., Dubrulle, P., Louise, S., & Rochange, C. (2014). Self-timed periodic scheduling for a cyclo-static dataflow model. In Procedia Computer Science (Vol. 29, pp. 1134–1145). Elsevier.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free