Lines Matching refs:nodes
33 I<node-affinity>. The node-affinity of a domain is the set of NUMA nodes
74 itself always tries to run the domain's vCPUs on one of the nodes in
132 both manual or automatic placement of them across the host's NUMA nodes.
164 to the nodes to which the pCPUs in the soft affinity mask belong;
170 will be equal to the nodes to which the pCPUs present both in hard and
188 nodes of an host is an incarnation of the Bin Packing Problem. In fact,
190 and the host nodes are the bins. As such problem is known to be NP-hard,
193 The first thing to do is find the nodes or the sets of nodes (from now
205 candidates involving fewer nodes are considered better. In case
206 two (or more) candidates span the same number of nodes,
225 Giving preference to candidates with fewer nodes ensures better
227 different nodes. Favoring candidates with fewer vCPUs already runnable
229 candidates fulfil these criteria, prioritizing the nodes that have the
291 it won't scale well to systems with arbitrary number of nodes.
293 if it is requested on a host with more than 16 NUMA nodes.