Scalable precision cache analysis for real-time software

Abstract

Caches are needed to increase the processor performance, but the temporal behavior is difficult to predict, especially in embedded systems with preemptive scheduling. Current approaches use simplified assumptions or propose complex analysis algorithms to bound the cache-related preemption delay. In this paper, a scalable preemption delay analysis for associative instruction caches to control the analysis precision and the time-complexity is proposed. An accurate preemption delay calculation is integrated into a cache-aware schedulability analysis. The framework is evaluated in several experiments.

Keywords

This publication has 18 references indexed in Scilit:

Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
Multiple process execution in cache related preemption delay analysis
Published by Association for Computing Machinery (ACM) ,2004
Accurate estimation of cache-related preemption delay
Published by Association for Computing Machinery (ACM) ,2003
Bounding cache-related preemption delay for real-time systems
IEEE Transactions on Software Engineering, 2001
Techniques to increase the schedulable utilization of cache-based preemptive real-time systems
Journal of Systems Architecture, 2000
Analysis of cache-related preemption delay in fixed-priority preemptive scheduling
IEEE Transactions on Computers, 1998
An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems, 1994
The effect of context switches on cache performance
Published by Association for Computing Machinery (ACM) ,1991
Finding Response Times in a Real-Time System
The Computer Journal, 1986
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM, 1973