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 some initial analysis that
bounds the additional delay due to blocks being evicted from
cache by other applications in a system using hierarchical
scheduling when using a local EDF scheduler.
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 some initial analysis that
bounds the additional delay due to blocks being evicted from
cache by other applications in a system using hierarchical
scheduling when using a local EDF scheduler.
| Original language | English |
|---|---|
| Title of host publication | Junior Researcher Workshop on Real-Time Computing (JRWRTC) |
| Pages | 13-16 |
| Number of pages | 4 |
| Publication status | Published - Aug 2014 |