Abstract: Classical schedulability analysis approaches usually consider the cost of preemption negligible. However, the time consumption is considerable for whole system in the case of high load and too much preemption. This paper discusses the condition of max preemptions with Rate Monotonic(RM) schedule arithmetic, and presents a method to reduce preemption. The task response time is shortened by reducing preemption.

Key words: Real-Time Operating System(RTOS), task preemption, Rate Monotonic(RM) schedule

摘要： 传统的实时系统可调度性分析方法往往忽略任务抢占的时间开销，然而在重负载情况下，如果任务抢占次数很多，则由此带来的时间开销将不可忽略。该文分析基于单调速率调度算法的系统中任务抢占次数最多需要满足的条件，提出通过修改任务参数来减少抢占次数的方法，减少了系统在最坏情况下的任务响应时间。

关键词: 实时系统, 任务抢占, RM调度

CLC Number: 

• N945