Here comes the second part of the node affine NUMA scheduler. > The patch comes in two parts. The first part is the core NUMA scheduler, > it is functional without the second part and provides following features: > - Node aware scheduler (implemented CPU pools). > - Scheduler behaves like O(1) scheduler within a node. > - Equal load among nodes is targeted, stealing tasks from remote nodes > is delayed more if the current node is averagely loaded, less if it's > unloaded. > - Multi-level node hierarchies are supported by stealing delays adjusted > by the relative "node-distance" (memory access latency ratio). > > The second part of the patch extends the pooling NUMA scheduler to > have node affine tasks: > - Each process has a homenode assigned to it at creation time > (initial load balancing). Memory will be allocated from this node. > - Each process is preferentially scheduled on its homenode and > attracted back to it if scheduled away for some reason. For > multi-level node hierarchies the task is attracted to its > supernode, too. Regards, Erich