期刊文献+

可支持多级关键度任务的实时操作系统 被引量:1

Real-time operating system supporting tasks of multilevel criticality
下载PDF
导出
摘要 为设计可支持多级关键度任务的军用实时操作系统MRTOS,首先分析了现有实时操作系统的调度机制。同时为定量描述任务的关键度,使用时间窗口来描述任务在有限时间范围内的时限错过情况。基于此描述,提出了改进型的最短紧急距离优先调度算法,该算法可保证实时任务仅错过规定数量的时限,能有效支持不同关键度任务同时运行在同一计算机上,同时可在任务量瞬时过载的情况下保证关键任务优先得到执行。最后通过仿真对最短紧急距离优先调度算法进行了例证。 To design the safety-critical real-time operating system, named military RTOS(MRTOS), which can support mixed criticality real-time tasks, the status of the existing scheduling mechanisms of real-time operating systems is firstly analyzed. A window-constraint technique is adopted to investigate the violation of task's deadline over a finite time range while task is consecutively invocated, which is used to define the criticality of real time task. As a result, a real time scheduling algorithm based on improved shortest urgent distance first (ESUDF) is proposed, The algorithm guarantees a real time task to just miss the specified deadline. Therefore, ESUDF can efficiently support the mixed criticality tasks to run on the same computer. At the same time, the high criticality real-time task is preferentially executed in case of instantaneous overload of tasks. At last, ESUDF algorithm is exemplified via simulation.
出处 《系统工程与电子技术》 EI CSCD 北大核心 2006年第4期615-619,共5页 Systems Engineering and Electronics
基金 国家"十五"项目(41315040106) 国防科技预研基金(2000J6.7.1.DZ0206)资助课题
关键词 安全关键 紧急距离 多级关键度 调度分析 实时操作系统 safety-critical urgenty distance multilevel criticality scheduling analysis real-time operating system
  • 相关文献

参考文献9

  • 1John C K.Safety critical system:challenges and directions[C] // Proc.of the 24th International Conference on Software Engineering,2002:547-550.
  • 2Liu C L,Layland J W.Scheduling algorithm for multiprogramming in a hard real time environment[J].Journal of the ACM,1973,20(1):40-61.
  • 3Nain P,Towsley D.Comparison of Hybrid minimum laxity/first in first out scheduling policies for real-time multiprocessors[J].IEEE Trans.on Computers,1992,41(10):1271-1278.
  • 4Hwang S I,Chen C M,Agrawala A K.Scheduling an overload real time system[C]// Proc.of the Fifteenth Annual International Phoenix Conference on Computers and Communications,1996:22-28.
  • 5LiuJ W S,Lin K J,Shih W K,et al.Algorithms for scheduling imprecise computations[J].Computer,1991,24(5):58-68.
  • 6Nicolau G B.Specification and analysis of weakly hard real time systems[D].Ph.D Dissertations,University of Les llles Balars,1998.
  • 7Wang Z,Song Y Q,Poggi E M,et al.Survey of weakly-hard real time schedule theory and its application[C]// Proc.of International Symposium on Distributed Computing and Applications to Business,Engineering and Science,2002.
  • 8Carlos M,Joni F.Dealing with overloading in tasks scheduling[C] // Proc.of the ⅩⅫ International Conference of the Chilean Computer Science Society,2002:24-29.
  • 9Bernat G,Burns A,Liamosi A.Weakly hard real-time systems[J].IEEE Trans.on Computers,2001,50(4):308-321.

同被引文献17

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部