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

Improved Real-time Scheduling Algorithm and its Application in Linux

作　　者：谭云福[1] 刘杰[1] 刘国华[1] 

机构地区：[1]燕山大学信息科学与工程学院,秦皇岛066004

出　　处：《计算机科学》2008年第10期256-258,共3页Computer Science

基　　金：国家自然科学基金(编号60773100)

摘　　要：在实时操作系统中,调度算法起着关键性的作用,然而调度算法的开销与系统的调度性能之间经常是一对矛盾。就此问题,结合最新版Linux2.6内核任务调度的特点,提出了一种改进的最小裕度优先(LSF)算法。针对LSF算法中因任务间的频繁切换造成系统开销增大的缺点,通过采用适当的抢占阈值策略减少"颠簸"现象,提高了Linux2.6内核的实时性。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 newest edition of Linux2. 6 kernel,an improved algorithm of least slack first（LSF＇） on the Linux2. 6 is realized. To solve the problem of the costly system for frequently switching among the tasks in LSF, we use proper preemption threshold policy to reduce the case of thrashing, and the real-time performance in the Linux kernel is improved.

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

分 类 号：TP316.81[自动化与计算机技术—计算机软件与理论] TP301.6[自动化与计算机技术—计算机科学与技术]