基于CFS组调度的CPU资源动态分配方法

摘要

进程调度作为 Linux 操作系统的核心，使系统其他部分联合成一个整体，在资源分配与系统推进方面发挥着至关重要的作用。对 CFS（completely fair scheduler）调度的算法及其过程进行研究，并结合组调度思想提出一种动态分配的 CFS 组调度策略。该调度算法以组负载作为 CPU 资源分配的主要标准，同时兼顾组间的公平性。根据这一原则，在原 Linux 内核基础上进行修改，实现了该过程。测试结果表明，该调度方式有效地处理了组在不同负载下，CPU 资源的分配问题，扩展了组调度的实用性。%As the core of Linux operating system,process scheduling integates other parts of the system into a whole,and plays a crucial role in resource allocation and system propulsion.In this paper,we study the algorithm of CFS (completely fair scheduler)scheduling and its process,and put forward a CFS group scheduling strategy with dynamic allocation in combination with group scheduling idea.This algorithm uses the load of group as the main standard in CPU resources allocation,at the same time balances the fairness between the groups as well. According to this principle,we make the modification the on the basis of original Linux kernel,and have realised the process.Test result shows,the scheduling way effectively solves the CPU resources allocation issue with different loads of the groups,and expands the practicality of group scheduling.