作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (1): 99-101,99.

• 软件技术与数据库 • 上一篇    下一篇

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

许 立,罗 军,卢 凯   

  1. 国防科技大学计算机学院,长沙 410073
  • 出版日期:2006-01-05 发布日期:2006-01-05

NUMA Scheduling Algorithm Based on Affinitive Node

XU Li, LUO Jun, LU Kai   

  1. School of Computer, National University of Defense Technology, Changsha 410073
  • Online:2006-01-05 Published:2006-01-05

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

关键词: 非一致存储访问;操作系统;分级调度;节点亲近能力

Abstract: 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 O(1) scheduling algorithm’s support for NUMA. The result shows that this algorithm realizes NUMA affinity scheduling, improves data access locality and system performance

Key words: NUMA; Operation system; Hierarchical scheduling; Affinitive node