Limited Preemptive Scheduling for Real-Time Systems. A Survey

作者：Buttazzo Giorgio C^*; Bertogna Marko; Yao Gang

来源：IEEE Transactions on Industrial Informatics, 2013, 9(1): 3-15.

DOI：10.1109/TII.2012.2188805

• Limited-preemptive scheduling
• nonpreemptive regions
• real-time systems

The question whether preemptive algorithms are better than nonpreemptive ones for scheduling a set of real-time tasks has been debated for a long time in the research community. In fact, especially under fixed priority systems, each approach has advantages and disadvantages, and no one dominates the other when both predictability and efficiency have to be taken into account in the system design. Recently, limited preemption models have been proposed as a viable alternative between the two extreme cases of fully preemptive and nonpreemptive scheduling. This paper presents a survey of the existing approaches for reducing preemptions and compares them under different metrics, providing both qualitative and quantitative performance evaluations.

• 出版日期2013-2