Improving feasibility of fixed priority tasks using non-preemptive regions

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2011, Pages 251-260

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

^a SCUOLA SUPERIORE SANT ANNA   (Italy)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FIXED PRIORITIES; NON-PREEMPTIVE; PRE-EMPTIVE SCHEDULER; PREEMPTIVE SOLUTIONS; PRIORITY TASKS; PROCESSOR UTILIZATION; SCHEDULABILITY; SIMULATION EXPERIMENTS; SINGLE PROCESSORS; WORST-CASE EXECUTION TIME;

COMPUTER NETWORKS; ELECTRICAL ENGINEERING;

REAL TIME SYSTEMS;

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

References (19)

1. S. Baruah, A. K. Mok, and L. E. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th Real-Time Systems Symposium (RTSS'90), Orlando, Florida, 1990.
2. M. Bertogna and S. Baruah. Limited preemption EDF scheduling of sporadic task systems. IEEE Transactions on Industrial Informatics, 6(4):579-591, 2010.
3. M. Bertogna, G. Buttazzo, M.Marinoni, G. Yao, F. Esposito, and M. Caccamo. Preemption points placement for sporadic task sets. In Proceedings of the 22nd Euromicro Conference on Real-Time Systems (ECRTS'10), Brussels, Belgium, June 2010.
4. M. Bertogna, O. Xhani, M. Marinoni, F. Esposito, and G. Buttazzo. Optimal scheduling with variable preemption overhead. In Proceedings of the 23rd Euromicro Conference on Real-Time Systems (ECRTS'11), Porto, Portugal.
5. E. Bini and G. Buttazzo. Measuring the performance of schedulability tests. Real-Time Syst., 30(1-2):129-154, 2005. (Pubitemid 41310221)
6. R.J. Bril, J.J. Lukkien, and W.F.J. Verhaegh. Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. Real-Time Systems: The International Journal of Time-Critical Computing, 42(1-3):63-119, 2009.
7. A. Burns. Dual priority scheduling: Is the processor utilization bound 100%? In Proceedings of 1st International Real-Time Scheduling Open Problems Seminar (RTSOPS), Brussels, Belgium.
8. A. Burns. Preemptive priority-based scheduling: an appropriate engineering approach. In Sang H. Son, editor, Advances in real-time systems, pages 225-248. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1995.
9. M. Joseph and P. K. Pandya. Finding response times in a real-time system. The Computer Journal, 29(5):390-395, October 1986. (Pubitemid 17463568)
10. U. Keskin, R.J. Bril, and J.J. Lukkien. Exact response-time analysis for fixed-priority preemption-threshold scheduling. In Work-in-Progress Session (WiP) of the 15th International Conference on Emerging Technologies and Factory Automation (ETFA), Bilbao, Spain, September 2010.
11. J. P. Lehoczky. Fixed priority scheduling of periodic tasks with arbitrary deadlines. In IEEE Real-Time Systems Symposium (RTSS'90), Orlando, Florida, 1990.
12. J. P. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of the Real-Time Systems Symposium (RTSS'89), Santa Monica, California, USA, December 1989.
13. J. Y.-T Leung and J.Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 2:237-250, 1982. (Pubitemid 13487696)
14. C. L. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, 1973.
15. J. Regehr. Scheduling tasks with mixed preemption relations for robustness to timing faults. In Proceedings of the IEEE International Real-Time Systems Symposium (RTSS'02), Cancun (Mexico), December 2002.
16. M. Saksena and Y. Wang. Scalable real-time system design using preemption thresholds. In Proceedings of the IEEE Real-Time Systems Symposium, Los Alamitos, CA, November 2000. IEEE Computer Society.
17. Y. Wang and M. Saksena. Scheduling fixed-priority tasks with preemption threshold. In Proceedings of the International Conference on Real-time Computing Systems and Applications. IEEE Computer Society, 1999.
18. G. Yao, G. Buttazzo, and M. Bertogna. Bounding the maximum length of non-preemptive regions under fixed priority scheduling. In RTCSA, Beijing, China, May-June 2009.
19. G. Yao, G. Buttazzo, and M. Bertogna. Feasibility analysis under fixed priority scheduling with fixed preemption points. In International Workshop on Real-Time Computing Systems and Applications (RTCSA), Macau, China, August 2010.