Browse > Article

Non-Preemptive Fixed Priority Scheduling for Design of Real-Time Embedded Systems  

Park, Moon-Ju (인천대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.15, no.2, 2009 , pp. 89-97 More about this Journal
Abstract
Embedded systems widely used in ubiquitous environments usually employ an event-driven programming model instead of thread-based programming model in order to create a more robust system that uses less memory. However, as the software for embedded systems becomes more complex, it becomes hard to program as a single event handler using the event-driven programming model. This paper discusses the implementation of non-preemptive real-time scheduling theory for the design of embedded systems. To this end, we present an efficient schedulability test method for a given non-preemptive task set using a sufficient condition. This paper also shows that the notion of sub-tasks in embedded systems can overcome the problem of low utilization that is a main drawback of non-preemptive scheduling.
Keywords
embedded system; real-time; scheduling;
Citations & Related Records
연도 인용수 순위
  • Reference
1 F. Dabek, N. Zeldovich, M. Frans Kaashoek, D. Mazieres, and R. Morris. Event-driven program-ming for robust software. In Proceedings of the 10th ACM SIGOPS European Workshop, pages 186-189, September 2002   DOI
2 M, Spuri. Analysis of deadline scheduled real-time systems. Technical report, INRIA, 1996
3 C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environ-ment. Journal of ACM, 20(1):46-61, 1973   DOI
4 R. Wilhelm, E. Jakob, N. Holsti, S. Thesing, D. Whalley, G. Bernat, C. Ferdinand, R. Heckmann, T. Mitra, F. Mueller, I. Puaut, P. Puschner, J. Staschulat, and P. Stenstrom. The worst-case execution-time problem -- overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems, 7(3), Article No. 36, 2008   DOI
5 J.V. Busquets-Mataix, J.J. Serrano, R. Ors, P. Gil, and A. Wellings. Using harmonic task-sets to increase the schedulable utilization of cache-based preemptive real time systems. in Proceedings of International Workshop on Real-Time Computing Systems Application, pages 195-202, 1996
6 Y. Wang and M. Saksena, Scheduling fixed-priority tasks with preemption threshold. In Pro-ceedings of IEEE International Conference on Real-Time Computing Systems and Applications, pages 328-335, 1999   DOI
7 R. I. Davis, A. Burns, R. J. Bril, and J. J, Lukkien, Controller Area Network (CAN) Sche-dulability Analysis: Refuted, Revisited and Revised, Real-Time Systems 35(3):239-272, 2007   DOI
8 J. K Strosnider, J. P. Lehoczky, and L. Sha. The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments. IEEE Transactions on Computers, 44(1):73-91, 1995.   DOI   ScienceOn
9 L -P. Chang. Event-driven scheduling for dynamic workload scaling in uniprocessor embedded sys-tems. In Proceedings of the 2006 ACM Smposium on Applied Computing, pages 1462-1466, 2006   DOI
10 K. Jeffay, D.F. Stanat, and C.U. Martel. On non-preemptive scheduling of periodic and sporadic tasks. In Proceedings of IEEE Real-Time Systems Symposium, pages 129-139, December 1991   DOI
11 T-W. Kuo and A.K. Mok. Incremental recon-figuration and load adjustment in adaptive real time systems. IEEE Transactions on Computers, 48(12):1313-1324, 1997   DOI   ScienceOn
12 S. K. Baruah, L. E. Rosier, and R. R. Howell. Algorithms and complexity concerning the preem-ptive scheduling of periodic, real-time tasks on one processor. Real- Time Systems. 2(4):301-324, 1990   DOI
13 L. Sha, R. Rajkumar, and J. Lehoczky. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers, 39(9):1175-1185, 1990   DOI   ScienceOn
14 R. Gerber, S. Hong, and M. Saksena. Guaran-teeing real-time requirements with resource-based calibration of periodic processes. IEEE Trans-actions on Software Engineering, 21(7):579-592, 1995   DOI   ScienceOn
15 T. M. Parks and E. A. Lee. Non-preemptive real- time scheduling of dataflow systems. In Procee-dings of IEEE International Conference on Acou-stics, Speech, and Signal Processing, pages 3225-3238, May 1995   DOI
16 L. George, N. Riviere, and M. Spuri. Preemptive and non-preemptive real -time uniprocessor scheduling. Techical report, INRIA, 1996
17 J.P. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characteri-zation and average case behaviour. In Proceedings of IEEE Real-Time Systems Symposium, pages 166-171, 1989   DOI
18 W. Wang, A. K. Mok, arid G. Fohier. Pre-sche-duling. Real-Time Systems, 30(1-2):83-103. 2005   DOI
19 F. Balarin and A. Sangiovanni-Vincentelli. Sche-dule validation for embedded reactive real-time systems. In Proceedings of the 34th Annual ACM/IEEE Conference on Design Automation, pages 52-57, 1997
20 P. Ramanathan and M. Hamdaoui. A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Transactions on Computers, 44(12):1443-1451, 1995   DOI   ScienceOn
21 W. Li, K. Kavi, and R. Akl. A non-preemptive scheduling algorithm for soft real-time systems. Computers and Electrical Engineering 33(1):12-29, 2007   DOI   ScienceOn
22 M. S. Branicky, S. M. Phillips, and W. Zhang. Scheduling and feedback co-design for networked control systems. In Proceedings of the 41st IEEE Conference on Decision and Control. pages 1211-1217, 2002   DOI