Linux中一种改进的实时调度算法及其应用

计算机科学 ›› 2008, Vol. 35 ›› Issue (10): 256-258.

Linux中一种改进的实时调度算法及其应用

谭云福刘杰刘国华

燕山大学信息科学与工程学院,秦皇岛066004

出版日期:2018-11-16 发布日期:2018-11-16
基金资助:
国家自然科学基金（编号60773100）.

TAN Yun-fu LIU Jie LIU Guo-hua （College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China）

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： 在实时操作系统中,调度算法起着关键性的作用,然而调度算法的开销与系统的调度性能之间经常是一对矛盾。就此问题,结合最新版Linux2.6内核任务调度的特点,提出了一种改进的最小裕度优先（LSF）算法。针对LSF算法中因任务间的频繁切换造成系统开销增大的缺点,通过采用适当的抢占阈值策略减少＂颠簸＂现象,提高了Linux2.6内核的实时性。

关键词: Linux 实时调度颠簸抢占阈值最小裕度优先

Abstract: In a real-time operating system, scheduling algorithm plays the vital role, but the cost of scheduling algorithm and the effect of scheduling in the system are often a pair of contradictions. Contacting the characteristics of the task scheduling in the ne

Key words: Linux, Real-time scheduling, Thrashing, Preemption threshold, LSF

谭云福刘杰刘国华. Linux中一种改进的实时调度算法及其应用[J]. 计算机科学, 2008, 35(10): 256-258. https://doi.org/

TAN Yun-fu LIU Jie LIU Guo-hua （College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China）. [J]. Computer Science, 2008, 35(10): 256-258. https://doi.org/

参考文献

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed