关键词: 实时系统, 调度算法, 单调速率调度算法, 延迟抢占单调速率调度算法

Abstract: Scheduling algorithms are one part of the real-time systems of high importance. Rate monotonic algorithm(RM) is a widely used real-time fixed priority algorithm, which has been proved to be optimal. Aiming at the problem that traditional rate monotonic algorithms ignore the time consumption of context switches, this paper proposes a delay preemption rate monotonic algorithm. The algorithm considers the time consumption of context switches, and can reduce the unnecessary preempting behavior to tasks which have lower priorities. The validation is also proved by experiment.

Key words: real-time system, scheduling algorithm, rate monotonic algorithm (RM), delay preemption rate monotonic algorithm