Improved Algorithm Based on Rate Monotonic Scheduling
YU Hui-qun · Jisuanji kexue yu tansuo · 2011
Scheduling algorithms are one part of the real-time systems of high importance.Rate monotonic algo-rithm (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 pro-poses 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.