Tightening the bounds on feasible preemptions

Transactions on Embedded Computing Systems

Volumn 10, Issue 2, 2010, Pages

  Ramaprasad, Harini ^a   Mueller, Frank ^a  

^a Southern Illinois University Carbondale   (United States)

Author keywords

Cache related preemption delay; Data caches; Preemptions; Real time systems; Timing analysis; Worst case execution time

Indexed keywords

CACHE-RELATED PREEMPTION DELAY; DATA CACHES; PREEMPTIONS; TIMING ANALYSIS; WORST-CASE EXECUTION TIME;

CACHE MEMORY;

REAL TIME SYSTEMS;

EID: 78751493186     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/1880050.1880063     Document Type: Conference Paper

References (32)

1. AUDSLEY, A. N., BURNS, A., RICHARDSON, M., AND TINDELL, K. 1993. Applying new scheduling theory to static priority pre-emptive scheduling. Softw. Eng. J., 284-292.
2. BASUMALLICK, S. AND NILSEN, K. 1994. Cache issues in real-time systems. In Proceedings of the Workshop on Language, Compiler, and Tool Support for Real-Time Systems. ACM, New York.
3. BURGER, D., AUSTIN, T., AND BENNETT, S. 1996. Evaluating future microprocessors: The simplescalar toolset. Tech. rep. CS-TR-96-1308, University of Wisconsin, Madison, CS Dept. July.
4. BUSQUETS-MATAIX, J. V. 1996. Adding instruction cache effect to an exact schedulability analysis of preemptive real-time systems. In Proceedings of the Euro-Micro Workshop on Real-Time Systems. IEEE, Los Alamitos, CA.
5. CHATTERJEE, S., PARKER, E.,HANLON, P., AND LEBECK, A. 2001. Exact analysis of the cache behavior of nested loops. In Proceedings of the Conference on Programming Language Design and Implementation. ACM, New York, 286-297.
6. FRAGUELA, B. B., DOALLO, R., AND ZAPATA, E. L. 1999. Automatic analytical modeling for the estimation of cache misses. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques. IEEE, Los Alamitos, CA.
7. GHOSH, S.,MARTONOSI, M., AND MALIK, S. 1997. Cache miss equations: An analytical representation of cache misses. In Proceedings of the International Conference on Super-Computing. ACM, New York, 317-324.
8. GHOSH, S.,MARTONOSI, M., AND MALIK, S. 1999. Cache miss equations: A compiler framework for analyzing and tuning memory behavior. ACM Trans. Program. Lang. Syst. 21, 4, 703-746.
9. JU, L., CHAKRABORTY, S., AND ROYCHOUDHURY, A. 2007. Accounting for cache-related preemption delay in dynamic priority schedulability analysis. In Proceedings of the Design Automation and Test in Europe. IEEE, Los Alamitos, CA.
10. KIM, S., MIN, S., AND HA, R. 1996. Efficient worst case timing analysis of data caching. In Proceedings of the Real-Time Embedded Technology and Applications Symposium. IEEE, Los Alamitos, CA.
11. LEE, C.-G., HAHN, J., SEO, Y.-M., MIN, S. L., HA, R., HONG, S., PARK, C. Y., LEE, M., AND KIM, C. S. 1998. Analysis or cache-related preemption delay in fixed-priority preemptive scheduling. IEEE Trans. Comput. 47, 6, 700-713.
12. LEE, C.-G., LEE, K., HAHN, J., SEO, Y.-M., MIN, S. L., HA, R., HONG, S., PARK, C. Y., LEE, M., AND KIM, C. S. 2001. Bounding cache-related preemption delay for real-time systems. IEEE Trans. Softw. Eng. 27, 9, 805-826.
13. LEHOCZKY, J., SHA, L., AND DING, Y. 1989. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA.
14. LI, Y.-T. S., MALIK, S., AND WOLFE, A. 1996. Cache modeling for real-time software: Beyond direct mapped instruction caches. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 254-263.
15. LIM, S.-S., BAE, Y. H., JANG, G. T., RHEE, B.-D., MIN, S. L., PARK, C. Y., SHIN, H., AND KIM, C. S. 1994. An accurate worst-case timing analysis for RISC processors. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 97-108.
16. LISPER, B. AND VERA, X. 2003. Data cache locking for higher program predictability. In Proceeding of the International Conference on Measurement and Modeling of Computer Systems. ACM, New York, 272-282.
17. LUNDQVIST, T. AND STENSTRÖM, P. 1999. Empirical bounds on data caching in high-performance real-time systems. Tech. rep., Chalmers University of Technology.
18. NEGI, H. S., MITRA, T., AND ROYCHOUDHURY, A. 2003. Accurate estimation of cache-related preemption delay. In Proceedings of the International Symposium on Hardware Software Co-Design. ACM, New York.
19. PUAUT, I. 2006. Wcet-centric software-controlled instruction caches for hard real-time systems. In Proceedings of the Euro-Micro Conference on Real-Time Systems. IEEE, Los Alamitos, CA.
20. PUAUT, I. AND DECOTIGNY, D. 2002. Low-complexity algorithms for static cache locking in multitasking hard real-time systems. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA.
21. RAMAPRASAD, H. AND MUELLER, F. 2005. Bounding worst-case data cache behavior by analytically deriving cache reference patterns. In Proceedings of the Real-Time Embedded Technology and Applications Symposium. IEEE, Los Alamitos, CA, 148-157.
22. RAMAPRASAD, H. AND MUELLER, F. 2006. Bounding preemption delay within data cache reference patterns for real-time tasks. In Proceedings of the Real-Time Embedded Technology and Applications Symposium. IEEE, Los Alamitos, CA, 71-80.
23. RAMAPRASAD, H. AND MUELLER, F. 2007. Bounding worst-case response time for tasks with non-preemptive regions. Tech. rep. TR 2007-22, Dept. of Computer Science, North Carolina State University.
24. STASCHULAT, J. AND ERNST, R. 2004. Multiple process execution in cache related preemption delay analysis. In Proceedings of the International Conference on Embedded Software. ACM, New York.
25. STASCHULAT, J. AND ERNST, R. 2006. Worst-case timing analysis of input dependent data cache behavior. In Proceedings of the Euro-Micro Conference on Real-Time Systems. IEEE, Los Alamitos, CA.
26. STASCHULAT, J., SCHLIECKER, S., AND ERNST, R. 2005. Scheduling analysis of real-time systems with precise modeling of cache related preemption delay. In Proceedings of the Euro-Micro Conference on Real-Time Systems. IEEE, Los Alamitos, CA.
27. TOMIYAMA, H. AND DUTT, N. D. 2000. Program path analysis to bound cache-related preemption delay in preemptive real-time systems. In Proceedings of the International Symposium on Hardware Software Co-Design. ACM, New York.
28. VERA, X., LLOSA, J.,GONŹALEZ, A., AND BERMUDO, N. 2000. A fast and accurate approach to analyze cache memory behavior (research note). In Proceedings of the 16th International Euro-Par Conference. Springer, Berlin, 194-198.
29. VERA, X. AND XUE, J. 2002. Let's study whole-program cache behavior analytically. In Proceedings of the International Symposium on High-Performance Computer Architecture. IEEE, Los Alamitos, CA.
30. WEGENER, J. AND MUELLER, F. 2001. A comparison of static analysis and evolutionary testing for the verification of timing constraints. Real-Time Syst. 21, 3, 241-268.
31. WHITE, R. T.,MUELLER, F., HEALY, C.,WHALLEY, D., AND HARMON, M. G. 1999. Timing analysis for data and wrap-around fill caches. Real-Time Syst. 17, 2/3, 209-233.
32. ZIVOJNOVIC, V., VELARDE, J., SCHLAGER, C., AND MEYR, H. 1994. Dspstone: A dsp-oriented benchmarking methodology. In Proceedings of the International Conference on Signal ProcessingApplications and Technology.