RM Schedule-based Max Task Preemption Times Analysis
Boyang Liu · Jisuanji gongcheng · 2009
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.