Multiple process execution in cache related preemption delay analysis

Cache prediction for preemptive scheduling is an open issue despite its practical importance. First analysis approaches use simplified models for cache behavior or they assume simplified preemption and execution scenarios that seriously impact analysis precision. We present an analysis approach which considers multiple executions of processes and preemption scenarios for static priority periodic scheduling. The results of our experiments show that caches introduce a strong and complex timing dependency between process executions that are not appropriately captured in the simplified models. Categories and Subject Descriptors: B.3.3: Worst-case analysis. General Terms: Algorithms, Measurement, Performance, Verification.

• Type: Conference
• Year: 2004
• Where: EMSOFT
• Authors: Jan Staschulat, Rolf Ernst
• Keywords: EMSOFT 2004, Preemption Scenarios, Priority Periodic Scheduling, Simplified Models