Cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2011, Pages 261-271

  Altmeyer, Sebastian ^a   Davis, Robert I ^b   Maiza, Claire ^c  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF YORK   (United Kingdom)

^c VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROPRIATE MODELS; CACHE CONFIGURATIONS; CACHE SETS; CACHE UTILIZATION; EMBEDDED MICROPROCESSORS; EMPIRICAL EVALUATIONS; FIXED PRIORITIES; MEMORY ACCESS; MEMORY SPEED; MUTUAL EXCLUSIONS; RESPONSE-TIME ANALYSIS; SCHEDULABILITY ANALYSIS; TASK EXECUTIONS; TIGHT BOUND; WORST-CASE EXECUTION TIME ANALYSIS;

COST BENEFIT ANALYSIS; EMBEDDED SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

REAL TIME SYSTEMS;

EID: 84856527978     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2011.31     Document Type: Conference Paper

References (28)

1. S. Altmeyer and C. Burguière. A new notion of useful cache block to improve the bounds of cache-related preemption delay. In Proceedings ECRTS, pages 109-118, 2009.
2. S. Altmeyer and C. Burguière. Influence of the task model on the precision of scheduling analysis for preemptive systems. In Proceedings RTSOPS, pages 5-6, July 2010.
3. S. Altmeyer, R.I. Davis, and C. Maiza. Pre-emption cost aware schedulability analysis. Technical report, Available from http://www-users.cs. york.ac.uk/ robdavis/, May 2011.
4. S. Altmeyer and C. Maiza. Cache-related preemption delay via useful cache blocks: Survey and redefinition. Journal of Systems Architecture, 2010.
5. S. Altmeyer, C. Maiza, and J. Reineke. Resilience analysis: Tightening the crpd bound for set-associative caches. In Proceedings LCTES, pages 153-162, New York, NY, USA, April 2010. ACM.
6. N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. J. Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8:284-292, 1993.
7. T. P. Baker. Stack-based scheduling for realtime processes. Real-Time Syst., 3:67-99, April 1991.
8. A. Bastoni, B. Brandenburg, and J. Anderson. Cache-related preemption and migration delays: Empirical approximation and impact on schedulability. In Proceedings OSPERT, pages 33-44, July 2010.
9. M. Bertogna, G. C. Buttazzo, M. Marinoni, G. Yao, F. Esposito, and M. Caccamo. Preemption points placement for sporadic task sets. In Proceedings ECRTS, pages 251-260, 2010.
10. M. Bertogna, O. Xhani, M. Marinoni, F. Esposito, and G. C. Buttazzo. Optimal selection of preemption points to minimize preemption overhead. In Proceedings ECRTS (to appear), 2011.
11. E. Bini and G. C. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, 30:129-154, 2005. 10.1007/s11241-005-0507-9. (Pubitemid 41310221)
12. C. Burguière, J. Reineke, and S. Altmeyer. Cache-related preemption delay computation for set-associative caches-pitfalls and solutions. In Proceedings WCET, 2009.
13. 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 RTAS, pages 204-212, 1996.
14. R.I. Davis, N. Merriam, and N.J. Tracey. How embedded applications using an rtos can stay within on-chip memory limits. In Proceedings Work in Progress RTSS, 2000.
15. R.I. Davis, A. Zabos, and A. Burns. Efficient exact schedulability tests for fixed priority real-time systems. IEEE Trans. Comput., 57:1261-1276, September 2008.
16. M. Joseph and P. Pandya. Finding Response Times in a Real-Time System. The Computer Journal, 29(5):390-395, May 1986. (Pubitemid 17463568)
17. U. Keskin, R.J. Bril, and J.J. Lukkien. Exact response-time analysis for fixed-priority preemption-threshold scheduling. In Proceedings Work-in-Progress Session ETFA, 2010.
18. 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):700-713, 1998. (Pubitemid 128740956)
19. T. Lundqvist and P. Stenström. Timing anomalies in dynamically scheduled microprocessors. In Proceedings RTSS, page 12, 1999.
20. S. Martin, P. Minet, and L. George. Non pre-emptive fixed priority scheduling with fifo arbitration: uniprocessor and distributed cases. Technical report, INRIA Rocquencourt, December 2007.
21. S. M. Petters and G. Farber. Scheduling analysis with respect to hardware related preemption delay. In In Workshop on Real-Time Embedded Systems, 2001.
22. H. Ramaprasad and F. Mueller. Tightening the bounds on feasible preemption points. In Proceedings RTSS, pages 212-224, 2006.
23. J. Regehr. Scheduling tasks with mixed preemption relations for robustness to timing faults. In Proceedings RTSS, 2002.
24. L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronization. IEEE Trans. Comput., 39:1175-1185, September 1990.
25. J. Staschulat, S. Schliecker, and R. Ernst. Scheduling analysis of real-time systems with precise modeling of cache related preemption delay. In Proceedings ECRTS, 2005.
26. Y. Tan and V. Mooney. Timing analysis for preemptive multitasking real-time systems with caches. Trans. on Embedded Computing Sys., 6(1), 2007.
27. H. Tomiyama and N. D. Dutt. Program path analysis to bound cache-related preemption delay in preemptive real-time systems. In Proceedings CODES, pages 67-71, 2000.
28. Y. Wang and M. Saksena. Scheduling fixed-priority tasks with pre-emption threshold. In Proceedings RTCSA, 1999.