期刊文献+

Linux实时调度算法研究 被引量:1

Research on Linux Real- time Scheduling Algorithm
下载PDF
导出
摘要 随着Linux的普及,Linux的实时性越来越受重视,但目前对该领域内研究进行综述的工作较少,并且已有的综述性工作主要从算法的自身结构对实时调度算法进行划分,而非从使用者的角度,根据解决的问题模式去划分,从而不易于指导工业级的应用实践。为此,文中从Linux实时调度算法所针对的问题模式出发,对实时算法进行分类。分类基于由内到外,从通用问题场景到具体应用问题场景的原则,最终形成了层次良好的分类结构。该分类的优点在于:除了更易于指导工业级的应用实践,也更加准确地描述了实时调度算法的本质特征。 With the popularity of Linux, the real-time features of Linux have attracted more attention, but there is a little research survey in this field at present, and existed survey mainly classifies real-time scheduling algorithm according to structure of algorithm rather, than from the user' s view, classifying according to the problem pattern. So, it' s not easy to guide the practice in industry by this way. For this reason, classify the real-time scheduling algorithm according to the problem pattern. The principles that the classification follows are from inside to outside, from general problem scenario to specific problem scenario. Finally, a well-organized hierarchy is obtained. The benefits of this classification are that besides guiding the practice of industry more easily, it describes the nature of real-time scheduling algorithm more accurately.
出处 《计算机技术与发展》 2015年第2期33-37,共5页 Computer Technology and Development
基金 国家核高基重大专项(2012ZX01039-004)
关键词 LINUX 实时 调度算法 问题模式 Linux real-time scheduling algorithm question pattern
  • 相关文献

参考文献29

  • 1Yao Gang, Buttazzo G, Bertogna M. Bounding the maximum length of non-preemptive regions under fixed priority schedu- ling[ C]//Proc of 15th IEEE international conference on em- bedded and real-time computing systems and applications. Beijing : IEEE ,2009:351-360.
  • 2Scordino C, Lipari G. Using resource reservation techniques for power-aware scheduling [ C ]//Proceedings of the 4th ACM international conference on embedded software. Pisa, Italy: ACM ,2004 : 16-25.
  • 3Burns A. Preemptive priority based scheduling:an appropriate engineering approach [ M ]. Upper Saddle River, NJ : Prentice Hall, 1995 : 225 -248.
  • 4Bertogna M, Buttazzo G, Yao Gang. Improving feasibility of fixed priority tasks using non-preemptive regions[ C]//Proc of 32nd IEEE real-time systems symposium. Vienna, Austria: IEEE ,2011:251-260.
  • 5Yao Gang, Buttazzo G C, Bertogna M. Comparative evaluation of limited preemptive methods [ C ]//Proc of IEEE conference on emerging technologies and factory automation. Bilbao: IEEE,2010 : 1-8.
  • 6Regehr J. Scheduling tasks with mixed preemption relations for robustness to timing faults[ C ]//Proc of 23rd IEEE real-time systems symposium. Austin, TX : IEEE, 2002 : 315 - 326.
  • 7Atlas A, Bestavros A. Design and implementation of statistical rate monotonic scheduling in KURT Linux [ C ]//Proc of 20th IEEE real - time systems symposium. Phoenix, AZ : IEEE,1999:272-276.
  • 8Nieh J,Vaill C, Zhong Hua. Virtual-time round-robin: an O ( 1 ) proportional share scheduler [ C ]//Proceedings of the 2001 USENIX annual technical conference. CA, USA:USE- NIX Association,2001:245-259.
  • 9Keskin U, Bril R J, Lukkien J J. Exact response-time analysis for fixed-priority preemption-threshold scheduling[ C ]//Proc of ETFA' 10. Bilbao : IEEE ,2010 : 1-4.
  • 10Short M. Improved sehedulability analysis of implicit deadline tasks under limited preemption EDF scheduling [ C ]//Proc of 16th ETFA' 11. Toulouse, France : IEEE ,2011 : 1-8.

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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