Lines Matching refs:of

6 Each scheduling domain spans a number of CPUs (stored in the ->span field).
7 A domain's span MUST be a superset of it child's span (this restriction could
17 pointer. The union of cpumasks of these groups MUST be the same as the
18 domain's span. The intersection of cpumasks from any two of these groups
24 is treated as one entity. The load of a group is defined as the sum of the
25 load of each of its member CPUs, and only when the load of a group becomes
26 out of balance are tasks moved between groups.
39 the parent sched_domain (if it exists), and the parent of the parent and so
43 If it succeeds, it looks for the busiest runqueue of all the CPUs' runqueues in
46 to our runqueue. The exact number of tasks amounts to an imbalance previously
50 The "base" domain will "span" the first level of the hierarchy. In the case
51 of SMT, you'll span all siblings of the physical CPU, with each group being
54 In SMP, the parent of the base domain will span all physical CPUs in the
56 of the SMP domain will span the entire machine, with each group having the
57 cpumask of a node. Or, you could do multi-level NUMA or Opteron, for example,
61 struct sched_domain fields, SD_FLAG_*, SD_*_INIT to get an idea of
66 retain the traditional SMT->SMP->NUMA topology (or some subset of that). This
75 CONFIG_SCHED_DEBUG. This enables an error checking parse of the sched domains