Feasibility analysis under fixed priority scheduling with fixed preemption points

Proceedings - 16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2010

Volumn , Issue , 2010, Pages 71-80

  Yao, Gang ^a   Buttazzo, Giorgio ^a   Bertogna, Marko ^a  

^a SCUOLA SUPERIORE SANT ANNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT SWITCH; EXTREME CASE; FEASIBILITY ANALYSIS; FEASIBILITY TESTS; FIXED PRIORITIES; FIXED PRIORITY SCHEDULING; NON-PREEMPTIVE; PREEMPTION MODELS; REAL-TIME TASKS; RESPONSE-TIME ANALYSIS; SHARED RESOURCES; SIMULATION EXPERIMENTS; WORST-CASE EXECUTION TIME;

COMPUTATIONAL COMPLEXITY; EMBEDDED SYSTEMS;

REAL TIME SYSTEMS;

EID: 78449294732     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTCSA.2010.40     Document Type: Conference Paper

References (28)

1. S. Altmeyer and G. Gebhard. Wcet analysis for preemptive scheduling. In 8th Int. Workshop on Worst-Case Execution Time Analysis, pages 105-112, Prague, Czech, July 2008.
2. T. P. Baker. Stack-based scheduling of real-time processes. Real-Time Systems, 3(1):67-100, March 1991.
3. S. Baruah. The limited-preemption uniprocessor scheduling of sporadic systems. In ECRTS '05: Proc. of Euromicro Conf. on Real-Time Systems, pages 137-144, July 2005.
4. E. Bini and G. C. Buttazzo. Schedulability analysis of periodic fixed priority systems. IEEE Trans. on Computers, 53(11):1462-1473, 2004.
5. E. Bini and G. C. Buttazzo. Measuring the performance of schedulability tests. Real-Time System, 30(1-2):129-154, 2005.
6. R. Bril. Specification and Compositional Verification of Real-Time Systems. PhD thesis, Technische UniversiteitEindhoven (TU/e), 2004.
7. R. Bril, J. Lukkien, and W. Verhaegh. Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. Real-Time System, 42(1-3):63-119, 2009.
8. A. Burns. Preemptive priority based scheduling: An appropriate engineering approach. S. Son, editor, Advances in Real-Time Systems, pages 225-248, 1994.
9. A. Burns and A. Wellings. Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX (Fourth Edition). Addison Wesley Longmain, 2009.
10. R. I. Davis, A. Burns, R. J. Bril, and J. J. Lukkien. Controller area network (can) schedulability analysis: Refuted, revisited and revised. Real-Time System, 35(3):239-272, 2007.
11. G. Frederickson. Scheduling unit-time tasks with integer release times and deadlines. Information Processing Letters, 16(4):171-173, May 1983.
12. M. Garey, D. Johnson, B. Simons, and R. Tarjan. Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM Journal of Computing, 10(2):256-269, 1981.
13. G. Gebhard and S. Altmeyer. Optimal task placement to improve cache performance. In Proc. of the ACM-IEEE Int. Conf. on Embedded Software, pages 259-268, Salzburg, Austria, 2007.
14. L. George, N. Rivierre, and M. Spuri. Preemptive and non-preemptive real-time uniprocessor scheduling. Research Report RR-2966, INRIA, France, 1996.
15. K. Jeffay, D. Stanat, and C. Martel. On non-preemptive scheduling of period and sporadic tasks. In Proc. of Real-Time Systems Symposium., pages 129-139, Dec 1991.
16. E. Lawler and C. Martel. Scheduling periodically occurring tasks on multiple processors. Information Processing Letters, 12(1):9-12, 1981. (Pubitemid 11505351)
17. 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 Trans. on Computers, 47(6):700-713, 1998.
18. J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proc. of the Real-Time Systems Symposium, pages 166-171, CA, USA, Dec 1989.
19. J. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation, 2(4):237-250, 1982.
20. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal ACM, 20(1):46-61, 1973.
21. A.-L. Mok. Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment. PhD thesis, MIT, USA, 1983.
22. H. Ramaprasad and F. Mueller. Tightening the bounds on feasible preemption points. In RTSS '06. Proc. of 27th Real-Time Systems Symposium, pages 212-222, Dec. 2006.
23. J. Regehr. Scheduling tasks with mixed preemption relations for robustness to timing faults. In Proc. of the 23rd IEEE Real-Time Systems Symposium, pages 315-326, 2002.
24. L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronization. IEEE Trans. on Computers, 39(9):1175-1185, 1990.
25. J. A. Stankovic and K. Ramamritham. The spring kernel: A new paradigm for real-time systems. IEEE Softw., 8(3):62-72, 1991.
26. J. Staschulat and R. Ernst. Multiple process execution in cache related preemption delay analysis. In Proc. of ACM Int. Conf. on Embedded software, pages 278-286, Pisa, Italy, 2004.
27. Y. Wang and M. Saksena. Scheduling fixed-priority tasks with preemption threshold. In Proc. of Conf. on Embedded and Real-Time Computing Systems and Applications, pages 328-335, 1999.
28. G. Yao, G. Buttazzo, and M. Bertogna. Bounding the maximum length of non-preemptive regions under fixed priority scheduling. In Proc. of Conf. on Embedded and Real-Time Computing Systems and Applications, pages 351-360, China, 2009.