Preemption threshold scheduling: Stack optimality, enhancements and analysis

Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS

Volumn , Issue , 2007, Pages 147-157

  Ghattas, Rony ^a   Dean, Alexander G ^a  

^a North Carolina State University

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DYNAMIC PROGRAMMING; EMBEDDED SYSTEMS; OPTIMAL SYSTEMS; REAL TIME SYSTEMS; REQUIREMENTS ENGINEERING;

PREEMPTION THRESHOLD SCHEDULING (PTS); REAL-TIME CONSTRAINTS; REAL-TIME EMBEDDED SYSTEMS; STACK OPTIMALITY;

SCHEDULING ALGORITHMS;

EID: 34548137305     PISSN: 15453421     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTAS.2007.27     Document Type: Conference Paper

References (25)

1. The Paparazzi Project. http://www.recherche.enac.-fr/paparazzi/.
2. A. N. Audsley, A. Burns, M. Richardson, and K. Tindell. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8:284-292, 1993.
3. T. P. Baker. Stack-based scheduling for real-time processes. Real-Time Syst., 3(1):67-99, 1991.
4. L. Barello. AvrX Real-Time Kernel. http://barello-.net/avrx/, 2006.
5. R. Barry. Free Real-Time Operating System, (Free R-TOS). http://www.freertos.org/, 2006.
6. J. Chen, A. Harji, and P. Buhr. Solution space for fixed-priority with preemption threshold. In RTAS '05: Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium, pages 385-394, San Francisco, CA, 2005. IEEE Computer Society.
7. W. Chen, Z. Wu, and X. Wang. Minimizing memory utilization of task sets in SmartOSEK. 19th International Conference on Advanced Information Networking and Applications, 02:552-558, 2005.
8. A. Coombs. Designing an efficient RTOS for a resource-constrained 8-bit microprocessor. Technical report, LiveDevices (Realogy), 2001.
9. R. Davis, N. Merriam, and N. Trace. How embedded applications using an RTOS can stay within on-chip memory limits. In In 12th Proceedings of Euromicro Conference on Real-Time Systems, Maastricht, Netherlands, June 2000.
10. Express Logic Corporation, http://www.express-logic.com. ThreadX User Guide, 2003.
11. P. Gai, G. Lipari, and M. D. Natale. Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In RTSS '01: Proceedings of the 22nd IEEE Real-Time Systems Symposium (RTSS'01), London, UK, 2001.
12. D.-Z. He, F.-Y. Wang, W. Li, and X.-W. Zhang. Hybrid earliest deadline first/preemption threshold scheduling for real-time systems. In International Conference, on Machine Learning and Cybernetics, 2004.
13. S. Kim, S. Hong, and T.-H. Kim. Perfecting preemption threshold scheduling for object-oriented real-time system design: from the perspective of real-time synchronization. In LCTES/SCOPES '02: Proceedings of the joint conference on Languages, compilers and tools for embedded systems, pages 223-232, Berlin, Germany, 2002. ACM Press.
14. W. Kim, J. Kim, and S. L. Min. Preemption-aware dynamic voltage scaling in hard real-time systems. In Proceedings of the 2004 international symposium on Low power electronics and design (ISLPED'04), pages 393-398, Newport Beach, California, USA, 2004. ACM Press.
15. J. J. Labrosse. Microc/OS-II. CMP Books, 2nd edition, 2002.
16. J. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In 11th Real-Time Systems Symposiom (RTSS' 90), Lake Buena Vista, FL, 1990.
17. J. W.-S. Liu. Real-Time Systems. Prentice Hall, Upper Saddle River, NJ, USA, 2000.
18. Mentor Graphics Corp., http://www.mentor.com. Nucleus OSEK.
19. F. Nemer, H. Cassé, P. Sainrat, J.-P. Bahsoun, and M. D. Michiel. Papabench: a free real-time benchmark. In F. Mueller, editor, 6th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, Dresden, Germany, 2006.
20. J. Regehr. Scheduling tasks with mixed preemption relations for robustness to timing faults. In RTSS '02: Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS'02), Austin, TX, 2002.
21. J. Regehr, A. Reid, and K. Webb. Eliminating stack overflow by abstract interpretation. Trans. on Embedded Computing Sys., 4(4):751-778, 2005.
22. M. Saksena, P. Karvelas, and Y. Wang. Automatic synthesis of multi-tasking implementations from real-timeobject-oriented models. In Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, Newport, CA, USA, 2002.
23. M. Saksena and Y. Wang. Scalable multi-tasking using preemption thresholds. In The 6th IEEE Real-Time Technology and Application Symposium, Cheju Island, South Korea, 2000.
24. K. W. Tindell, A. Burns, and A. J. Wellings. An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Systems, 6(2):133-151, 1994.
25. Y. Wang and M. Saksena. Scheduling fixed-priority tasks with preemption thresholds. In RTCSA '99: Proceedings of the Sixth International Conference on Real- Time Computing Systems and Applications, Hong Kong, China, 1999.