摘要
根据ASOS的特点和实际实时任务的特性,该文提出了一种建立在RM上的算法:NPT算法。它能很好地实现可抢占与不可抢占任务在单一处理器中的调度,并具有RM算法的一些良好的基本特性。还研究了这种算法的性质,给出并证明了NPT算法的任务可调度性充分条件。此外,对NPT算法下的最坏响应时间计算也作了论述。
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.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2005年第11期4-6,43,共4页
Computer Engineering
基金
国家自然科学基金资助项目(60334020)
国家杰出青年科学基金资助项目(60125310)
关键词
实时系统
特定应用操作系统
调度算法
Real-time systems
Application specific operating systems( ASOS)
Scheduling algorithm
