Cache allocation for fixed-priority real-time scheduling on multi-core platforms

With the increasing demand for higher performance, the adoption of multicores has been a major stepping stone in the evolution of hard real-time systems. Though the computational bandwidth is increased due to parallel processing, the indispensable interactivity between the hierarchical memory sub-system and multiple cores has further aggravated the already complex worst case execution time (WCET) analysis of tasks. Furthermore, caches have the biggest influence on task execution time, and the inclusion of shared caches further increases the unpredictability of the system. Cache partitioning techniques have been proposed as a counter-measure to decouple the shared cache latency from the WCET. However, existing energy-efficient scheduling algorithms are oblivious to the unpredictable nature of shared caches or cache partitioning techniques, thus, diminishing their applicability to real-world systems. Without considering inter-task cache contention, directly using existing algorithms or attempting to allocate and schedule a taskset with cache-partition assignments can result in cache violations. To overcome this dilemma, we propose a novel approach to model inter-task cache contention as a dependency graph to be used by well-established algorithms to minimize energy consumption. Extensive simulations demonstrate the effectiveness of our approach to minimize energy consumption while also avoiding cache violations.

show abstract

Cache allocation for fixed-priority real-time scheduling on multi-core platforms

Cited by 3 publications

References 25 publications

An Improved Model for System-Level Energy Minimization on Real-Time Systems

An Improved Model for System-Level Energy Minimization on Real-Time Systems

The R2-D2 toolchain — Automated porting of safety-critical applications to FPGAs

Energy-efficient Real-time Scheduling on Multicores

Contact Info

Product

Resources

About