Self-Timed Periodic Scheduling For Cyclo-Static DataFlow Model - Université Toulouse III - Paul Sabatier - Toulouse INP Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Self-Timed Periodic Scheduling For Cyclo-Static DataFlow Model

Résumé

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.
Fichier principal
Vignette du fichier
Dkhil_12956.pdf (441.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01136092 , version 1 (26-03-2015)

Identifiants

  • HAL Id : hal-01136092 , version 1
  • OATAO : 12956

Citer

Amira Dkhil, Xuankhanh Do, Paul Dubrulle, Stéphane Louise, Christine Rochange. Self-Timed Periodic Scheduling For Cyclo-Static DataFlow Model. Workshop on Architecture, Languages, Compilation and Hardware support for Emerging ManYcore systems - ALCHEMY 2014, Jun 2014, Cairns, Australia. pp. 1134-1145. ⟨hal-01136092⟩
151 Consultations
113 Téléchargements

Partager

Gmail Facebook X LinkedIn More