Abstract
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.
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.
| Original language | English |
|---|---|
| Journal | Real-Time Systems |
| Early online date | 3 Jun 2015 |
| DOIs | |
| Publication status | Published - Jun 2015 |
Keywords
- real-time
- cache related preemption delay
- hierarchical scheduling