Cache-aware Scheduling with Limited Preemptions
نویسندگان
چکیده
In safety-critical applications, the use of advanced real-time scheduling techniques is significantly limited by the difficulty of finding tight estimations of worst-case execution parameters. This problem is further complicated by the use of cache memories, which reduce the predictability of the executing threads due to cache misses. In this paper, we analyze the effects of preemptions on worstcase execution times, taking into account the main factors that affect task response times, such as context switches, cache misses, and bus contention. In particular, a limited preemption model with fixed preemption points is proposed as a viable scheduling strategy to improve the schedulability and the predictability of a given task system. The proposed method provides information on where to place preemption points in the task code to obtain a feasible schedule. A trade-off between preemptive and non-preemptive scheduling is investigated, to balance the increased blocking caused by non-preemptive sections and the beneficial reduction of the cache miss ratio.
منابع مشابه
Performance Analysis of Preemption-Aware Scheduling in Multi-cluster Grid Environments
In multi-cluster Grids each cluster serves requests from external (Grid) users along with their own local users. The problem arises when there is not sufficient resources for local users (which have high priority) to be served urgently. This problem could be solved by preempting resources from Grid users and allocating them to the local users. However, resource preemption entails decreasing res...
متن کاملCache-Related Preemption and Migration Delays: Empirical Approximation and Impact on Schedulability∗
A job that is impeded by a preemption or migration incurs additional cache misses when it resumes execution due to a loss of cache affinity. While often regarded negligible in scheduling-theoretic work, such cache-related delays must be accounted for when comparing scheduling algorithms in real systems. Two empirical methods to approximate cacherelated preemption and migration delays on actual ...
متن کاملQoS and preemption aware scheduling in federated and virtualized Grid computing environments
Resource provisioning is one of the challenges in federated Grid environments. In these environments each Grid serves requests from external users along with local users. Recently, this resource provisioning is performed in the form of Virtual Machines (VMs). The problem arises when there are insufficient resources for local users to be served. The problem gets complicated further when external...
متن کاملIntegrated Intra- and Inter-task Cache Analysis for Preemptive Multi-tasking Real-Time Systems
In this paper, we propose a timing analysis approach for preemptive multi-tasking real-time systems with caches. The approach focuses on the cache reload overhead caused by preemptions. The Worst Case Response Time (WCRT) of each task is estimated by incorporating cache reload overhead. After acquiring the WCRT of each task, we can further analyze the schedulability of the system. Four sets of ...
متن کامل