Linux2.6内核O(1)调度算法剖析  

The analysis of the process scheduling mechanism in Linux kernel 2.6

作　　者：张永选[1] 姚远耀 

机构地区：[1]江西经济管理干部学院电子计算机应用系,江西南昌330088

出　　处：《韶关学院学报》2009年第6期5-9,共5页Journal of Shaoguan University

摘　　要：分析了Linux 2.4内核调度机制存在的缺陷和Linux 2.6内核进程调度机制的特点.对于Linux 2.6内核,探讨了调度时机、调度策略以及Linux 2.6内核新引入的内核抢占机制,重点讨论了调度有关的重要数据结构、O(1)调度算法及其实现的细节.Several weaknesses of the process scheduling of Linux 2.4 kernel and some strong points of the Linux 2.6 Kernel＇s Mechanism of process scheduling are introduced. For Linux kernel 2.6, this paper analyzes strategies in scheduling time, scheduling policy, and kernel preemption first introduced by kernel 2.6. Then, the focus is placed on analyzing and discussing corresponding data structures, O（1） scheduling algorithm, and it＇s implementation details.

关 键 词：LINUX 内核 O(1) 进程调度 内核抢占 

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