Skip to Main Content
With the development of multicore systems, multicore real time scheduling is becoming a hot topic in time-critical systems. Cache warm-up overheads introduced by task migration between two cores can result in missed deadlines for tight realtime schedules. In this paper, we present an exact method for multicore schedule ability analysis under cache warm-up overheads. The result of the analysis is used to determine whether it's necessary to change the scheduling algorithm or the hardware architecture. Correct and schedulable properties of the model are formalized and verified. It is shown that our approach is less pessimistic than bound tests.