Preemptive and Non-preemptive Scheduling for ASOS
Xiang-wen Zhang · Jisuanji gongcheng · 2005
According to the characteristic of ASOS and real-time task, an approach based on RM(rate-monotonic) algorithm, NPT(non-preemptive threshold)algorithm is investigated. This algorithm can perfectly schedule preemptive and non-preemptive tasks in uni-processor, meanwhile some excellence of RM can be gained. In addition, a calculation of the worst response time based on NPT algorithm is given. The properties of this algorithm are deeply studied, and a useful sufficient condition is derived and proofed.