Integration of cache related preemption delay analysis into a priority assignment algorithm (Poster Short Paper) - Université de Bretagne Occidentale Access content directly
Conference Poster Year : 2014

Integration of cache related preemption delay analysis into a priority assignment algorithm (Poster Short Paper)

Hai-Nam Tran
Frank Singhoff
Stéphane Rubini
Jalil Boukhobza

Abstract

Handling cache related preemption delay (CRPD) in pre-emptive scheduling context for real-time systems stays an open issue despite of its practical importance. Priority assignment algorithms and feasibility tests are usually based on the assumption that the preemption cost is negligible. Then, a system that could be schedulable on design time can fail to meet its timing constraints in practice due to preemption costs. In this article, we propose a simple approach to take into account the CRPD when performing priority assignment. The goal is to have a priority assignment algorithm which guarantees the schedulability of systems when tasks suffer CRPD on run-time. For such a purpose, we propose an extension of the feasibility test of Audsley and illustrate it with some examples. An implementation of our priority assignment method has been integrated to the Cheddar scheduling analyzer. A comparison of the proposed algorithm with classical priority assignment algorithms is achieved.
Fichier principal
Vignette du fichier
ewili14.pdf (610.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01166868 , version 1 (23-06-2015)
hal-01166868 , version 2 (15-09-2016)

Identifiers

  • HAL Id : hal-01166868 , version 1

Cite

Hai-Nam Tran, Frank Singhoff, Stéphane Rubini, Jalil Boukhobza. Integration of cache related preemption delay analysis into a priority assignment algorithm (Poster Short Paper). EWiLi'14, The 4th Embedded Operating Systems Workshop., Sep 2014, Lisbon, Portugal. ⟨hal-01166868v1⟩
129 View
195 Download

Share

Gmail Facebook X LinkedIn More