NUMA Scheduling Algorithm Based on Affinitive Node
Lu Kai · Jisuanji gongcheng · 2006
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.