具有节点亲近能力的NUMA调度算法

NUMA Scheduling Algorithm Based on Affinitive Node

非一致存储访问(Non-UniformMemoryAccess,NUMA)是目前高性能服务器的主流体系结构之一,传统操作系统的调度器由于无法感知复杂NUMA系统的拓扑结构,导致较大的远程节点数据访问开销。该文在深入分析O(1)调度算法对NUMA支持的基础上,提出一种基于NUMA拓扑结构的分级调度算法。实验证明,该算法较好地实现了具有节点亲近能力的NUMA调度,提高了数据访问的局部性,优化了系统性能。

Nowadays, non-uniform memory access is one of mainstream architectures in high performance server, and traditional operation system＇s scheduling incurs lots of data access cost to remote node because of lack of topology information for NUMA. This paper presents a hierarchical scheduling algorithm based on NUMA topology after analyzing the 0（1） scheduling algorithm＇s support for NUMA. The result shows that this algorithm realizes NUMA affinity scheduling, improves data access locality and system performance.