Cache related pre-emption delays in hierarchical scheduling

Will Lunniss (1) , Sebastian Altmeyer (2) , Giuseppe Lipari (3) , Robert Davis (1)

1 Department of Computer Science
2 LASSY - Laboratory of Advanced Software SYstems [Luxembourg]
3 CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189

Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry as it allows applications from multiple vendors as well as legacy applications to co-exist in isolation on the same platform. However, performance enhancing features such as caches mean that one application can interfere with another by evicting blocks from cache that were in use by another application, violating the requirement of temporal isolation. In this paper, we present analysis that bounds the additional delay due to blocks being evicted from cache by other applications in a system using hierarchical scheduling when using either a local FP or EDF scheduler.

Mots clés: Cache related pre-emption delays; Hierarchical scheduling; Fixed priority pre-emptive scheduling; Earliest deadline first pre-emptive scheduling; Response time analysis

Domaines: Systèmes embarqués; Système d'exploitation [cs.OS]

Will Lunniss, Sebastian Altmeyer, Giuseppe Lipari, Robert Davis. Cache related pre-emption delays in hierarchical scheduling. Real-Time Systems, 2016, 52 (2), pp.201-238. ⟨10.1007/s11241-015-9228-x⟩. ⟨hal-01287347⟩