摘要
任务间的依赖性和可预测性是实时系统中的一对矛盾。该文就这个问题提出了“时间标签”调度算法。此算法基于通用的RMS算法结构,并借助了priorityceiling的思想,对资源描述对象进行了扩充。通过在rtLinux系统中的实现,证实了该算法的有效性,结果令人满意。
Dependence and predictability are a pair of contradictions in a real-time system.To solve the problem a real -time scheduling algorithm termed time -label scheduling algorithm is presented.The algorithm is built in RMS framework,employing priority ceiling protocol and expanding the description of resources.The algorithm is implemented in rtLinux system.The validity of the algorithm is confirmed through some examples.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第9期61-63,共3页
Computer Engineering and Applications
基金
清华大学985学科规划院重点项目"嵌入式操作系统和嵌入式软件开发环境创新技术与方法的研究"支持
