Cache-Partitioned Preemption Threshold Scheduling

Abstract

For preemptive scheduling with shared cache, different tasks may cause interference in the shared cache, leading to Cache-Related Preemption Overhead (CRPD). Cache partitioning can be used to reduce or eliminate CRPD. We propose integration of cache partitioning and Preemption Threshold Scheduling to optimize schedulability for both Fixed-Priority and Earliest Deadline First scheduling algorithms on a uniprocessor. We let each subset of tasks assigned the same cache partition be a nonpreemptive group by assigning the same preemption threshold to them, which eliminates CRPD both within each cache partition and between different cache partitions.