摘要
分析基本Linux内核的调度策略,指出其应用于实时系统时存在的不足,提出了一种增强Linux内核调度性能的实时任务调度策略和调度算法。结合任务的关键性、截止期和执行时间三要素,该调度策略通过三运行队列代替原Linux内核的单运行队列,分别对应系统的硬实时、软实时和非实时任务,保证了硬实时任务的实时性;不同于简单的FIFO调度算法,该调度算法根据任务的最小松弛时间和重要性来确定其在当前运行队列中的优先级,仿真结果表明此算法提高了实时调度性能。
The real-time schedule strategy of Linux kernel was analyzed, and its disadvantage was pointed out when applied to real-time system. In order to enhance the real-time scheduling performance of Linux kernel, a novel scheduling strategy and scheduling algorithm were presented. To ensure the requirements of real-time tasks, this scheduling strategy used a triple run queue to replace the original single run queue. The Value ＆ Minimum-Laxity-First Scheduling （VMLF） algorithm was proposed instead of the original kernel FIFO algorithm and the simulation experiment is investigated to show the efficiency of this schedule algorithm.
出处
《微计算机信息》
北大核心
2006年第05Z期42-44,共3页
Control & Automation
基金
湖北省教育厅重点科研项目(B200519001)
