Integrating task scheduling and cache locking for multicore real-time embedded systems

Abstract

Modern embedded processors provide hardware support for cache locking, a mechanism used to facilitate the WCET (Worst-Case Execution Time) calculation of a task. We investigate the problem of integrating task scheduling and cache locking for a set of preemptible tasks with individual release times and deadlines on a multi-core processor with two-level caches. We propose a novel integrated approach that schedules the task set and allocates the locked cache contents of each task to the local caches (L1 caches) and the level-two cache (L2 cache). Our approach consists of three major components, the task scheduler, the L1 cache allocator, and the L2 cache allocator. The task scheduler aims at minimizing the number of task preemptions. The L1 cache allocator converts the interference graph of all the tasks scheduled on each core into a DAG by considering the preemptions between tasks and allocates the L1 cache space to each task. The L2 cache allocator converts the interference graph of all the tasks into a DAG by using a k-longest-path-based graph orientation algorithm and allocates the L2 cache space to each task. Both cache allocators significantly improve the cache utilization for all the caches due to the efficient use of the interference graphs of tasks. We have implemented our approach and compared it with the extended version of the preemption tree-based approach and the static analysis approach without cache locking by using a set of benchmarks from the MRTC WCET benchmark suite and SNU real-time benchmarks. Compared to the extended version of the preemption tree-based approach, the maximum WCRT (Worst Case Response Time) improvement of our approach is 15%. Compared to the static analysis approach, the maximum WCRT improvement of our approach is 37%.

A Survey of Timing Verification Techniques for Multi-Core Real-Time Systems

“…An integrated task scheduling and cache locking/partitioning approach was presented by Zheng et al [139] in 2017. The processor consists of m homogeneous cores with local L1 caches and a shared L2 cache.…”

Toward Bounds on Parallel Execution Times of Task Graphs on Multicores With Memory Constraints

“…There are a lot of works in history on scheduling of parallel programs on multiprocessors and multicores, each adopting different approaches for different goals [6]- [11]. In the early days, compute resources are always the scarce resources for optimization in the scheduling as the number of processors as well as their associated cores are quite limited, and their performance is also relatively low.…”