Low-complexity algorithms for static cache locking in multitasking hard real-time systems

Proceedings-Real-Time Systems Symposium

Volumn , Issue , 2002, Pages 114-123

  Puaut, Isabelle ^a   Decotigny, David ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTATIONAL COMPLEXITY; COMPUTER OPERATING SYSTEMS; MULTITASKING; SCHEDULING;

HARD REAL TIME SYSTEMS; STATIC CACHE LOCKING; WORST CASE EXECUTION TIMES;

REAL TIME SYSTEMS;

EID: 0036991624     PISSN: 10528725     EISSN: None     Source Type: Journal    
DOI: 10.1109/REAL.2002.1181567     Document Type: Article

References (19)

1. Oren Avissar, Rajeev Barua, and Dave Stewart. Heterogenous memory management for embedded systems. In Proc. of the International Conference on Compilers, Architectures and Synthesis for Embedded Systems, Atlanta, GA, USA, November 2001.
2. M. Alt, C. Ferdinand, F. Martin, and R. Wilhelm. Cache behavior prediction by abstract interpretation. In SAS'96, Static Analysis Symposium, Volume 1145 of Lecture Notes in Computer Science, pages 51-66. Springer, September 1996.
3. J. V. Busquets-Mataix, J. J. Serrano, R. Ors, P. Gil, and A. Wellings. Adding instruction cache effect to schedulability analysis of preemptive real-time systems. In Proceedings of the 1996 Real-Time technology and Applications Symposium, pages 204-212. IEEE Computer Society Press, June 1996.
4. S. Basumallick and K. Nilsen. Cache issues in real-time systems. In ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems, June 1994.
5. M. Campoy, A. P. Ivars, and J. V. Busquets-Mataix. Static use of locking caches in multitask premptive real-time systems. In IEEE/IEE Real-Time Embedded Systems Workshop (Satellite of the IEEE Real-Time Systems Symposium), London, UK, December 2001.
6. A. Colin and I. Puaut. Worst case execution time analysis for a processor with branch prediction. Real-Time Systems, 18(2-3):249-274, May 2000.
7. A. Colin and I. Puaut. A modular and retargetable framework for tree-based WCET analysis. In Proc. of the 13th Euromicro Conference on Real-Time Systems, pages 37-44, Delft, The Netherlands, June 2001.
8. C. Healy, R. Arnold, F. Mueller, D. Whalley, and M. Harmon. Bounding pipeline and instruction cache performance. IEEE Transactions on Computers, 48(1), January 1999.
9. M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal, 29(5):390-395, 1986.
10. J. I. Katcher, H. Arakawa, and J. K. Strosnider. Engineering and analysis of fixed priority schedulers. IEEE Transactions on Software Engineering, 19(9):920-934, September 1993.
11. D. B. Kirk. Smart (strategic memory allocation for real-time) cache design. In Proceedings of the 10th IEEE Real-Time Systems Symposium (RTSS89), pages 229-237, Santa Monica, California, USA, December 1989.
12. C. G. Lee, J. Hahn, Y. M. Seo, S. L. Min, R. Ha, S. Hong, C. Y. Park, M. Lee, and C. S. Kim. Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. IEEE Transactions on Computers, 47(6), June 1998.
13. C.L. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, January 1973.
14. Y.-T. S. Li, S. Malik, and A. Wolfe. Cache modeling for real-time software: Beyond direct mapped instruction cache. In Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS96), pages 254-263. IEEE, IEEE Computer Society Press, December 1996.
15. Thomas Lundqvist and Per Stenstrom. An integrated path and timing analysis method based on cycle-level symbolic execution. Real-Time Systems, 17(2-3):183-207, November 1999.
16. F. Mueller. Timing analysis for instruction caches. Real-Time Systems, 18(2):217-247, May 2000.
17. P. Puschner and A. Burns. A review of worstcase execution-time analysis. Real-Time Systems, 18(2-3):115-128, May 2000. Guest Editorial.
18. John E. Sasinowski and Jay K. Strosnider. A dynamic programming algorithm for cache/memory partitioning for real-time systems. IEEE Transactions on Computers, 42(8):997-1001, August 1993.
19. K. Tindell, A. Burns, and A. Wellings. An extendible approach for analysing fixed priority hard real-time tasks. Real-Time Systems, 6(1):133-151, March 1994.