Jan Staschulat
Abstract
Accurate timing analysis is key to efficient embedded system synthesis and integration. Caches are needed to increase the processor performance but they are hard to use because of their complex behavior especially in preemptive scheduling. Current approaches use simplified assumptions or propose exponentially complex analysis algorithms to bound the cache related preemption delay at a context switch. Existing approaches consider only direct mapped caches or propose non conservative approximation for set associative caches.In this paper we propose a novel cache related preemption delay analysis for set-associative instruction caches where the designer can adjust the analysis precision by scaling the problem complexity. Furthermore, this precise preemption delay analysis is integrated into a scheduling analysis to determine the response time of tasks accurately. In experiments we evaluate this tradeoff between analysis precision and analysis time. The results show an improvement of 22%-71% in analysis precision of cache related preemption delay and 5%-21% in response time analysis compared to previous conservative approaches.
- A. V. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, GB, 1988. Google Scholar
Digital Library
- ARM Developer Suite, (ADS) version 1.2. http://www.arm.com.Google Scholar
- A. Burns. Preemptive priority based scheduling, chapter An appropriate engineering approach, pages 225--248. Prentice-Hall International, Inc., 1994. Google ScholarDigital Library
- J. V. Busquets-Mataix and A. Wellings. Adding instruction cache effect to schedulability analysis of preemptive real-time systems. In Proceedings of the IEEE Real-Time Technology and Applications Symposium, pages 204--212, June 1996. Google ScholarDigital Library
- M. Campoy, A. P. Ivars, and J. V. Busquets-Mataix. Static use of locking caches in multitask preemptive real-time systems. In IEEE Real-Time Embedded System Workshop, December 2001.Google Scholar
- A. Datta, S. Choudhury, A. Basu, H. Tomiyama, and N. Dutt. Satisfying timing constraints of preemptive real-time tasks through task layout technique. In IEEE VLSI Design, pages 97--102, January 2001. Google ScholarDigital Library
- S.-S. L. et al. An accurate worst case timing analysis for risc processors. IEEE Transactions on Software Engineering, 21(7):593--603, July 1995. Google ScholarDigital Library
- Infineon. Tricore 1 manual http://www.infineon.com.Google Scholar
- M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal (British Computer Society), 29:390--395, Oct. 1986.Google Scholar
- D. B. Kirk. Smart (strategic memory allocation for real-time) cache design. In IEEE Real-Time Systems Symposium, pages 229--239, 1989.Google Scholar
- C.-G. Lee, J. Hahn, and Y.-M. S. et al. Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. IEEE Transactions on computers, 47(6):700--713, June 1998. Google ScholarDigital Library
- C.-G. Lee, K. Lee, and J. H. et al. Bounding cache-related preemption delay for real-time systems. IEEE Transactions on software engineering, 27(9):805--826, November 2001. Google ScholarDigital Library
- J. Liedtke, H. Härtig, and M. Hohmuth. Os-controlled cache predictability for real-time systems. In RTAS, Montreal, Canada, June 9-11 1997. Google ScholarDigital Library
- H. S. Negi, T. Mitra, and A. Roychoudhury. Accurate estimation of cache-related preemption delay. In CODES+ISSS'03, Newport Beach, CA, USA, Oct. 2003. Google ScholarDigital Library
- P. R. Panda, N. D. Dutt, and A. Nicolau. Memory Issues in Embedded Systems-On-Chip: Optimizations and Exploration. Kluwer Academic Publishers,Norwell, MA, 1999. Google ScholarDigital Library
- S. M. Petters and G. Färber. Scheduling analysis with respect to hardware related preemption delay. In Workshop on Real-Time Embedded Systems, London, UK, Dec. 2001.Google Scholar
- I. Puaut and D. Decotigny. Low-complexity algorihtms for static cache locking in multitasking hard real-time systems. In RTSS, 2002. Google ScholarDigital Library
- J. Staschulat and R. Ernst. Multiple process execution in cache related preemption delay analysis. In EMSOFT, Pisa, Italy, Sept. 2004. Google ScholarDigital Library
- J. Staschulat, S. Schliecker, and R. Ernst. Scheduling analysis of real-time systems with precise modeling of cache related preemption delay. In submitted to EUROMICRO Conference on Real-Time Systems, Palma de Mallorca, Spain, July 2005. Google ScholarDigital Library
- Symta/S - symbolic timing analyis of systems. www.symta.org.Google Scholar
- H. Tomiyama and N. D. Dutt. Program path analysis to bound cache-related preemption delay in preemptive real-time systems. In CODES, 2000. Google ScholarDigital Library
Index Terms
- Scalable precision cache analysis for preemptive scheduling
Recommendations
Scalable precision cache analysis for preemptive scheduling
LCTES '05: Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systemsAccurate timing analysis is key to efficient embedded system synthesis and integration. Caches are needed to increase the processor performance but they are hard to use because of their complex behavior especially in preemptive scheduling. Current ...
Scalable precision cache analysis for real-time software
Special Section LCTES'05Caches 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 ...
Multiple process execution in cache related preemption delay analysis
EMSOFT '04: Proceedings of the 4th ACM international conference on Embedded softwareCache 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 ...
Comments