Searched refs:distances (Results 1 – 9 of 9) sorted by relevance
2178 int i, *distances; in find_numa_distance() local2184 distances = rcu_dereference(sched_numa_node_distance); in find_numa_distance()2185 if (!distances) in find_numa_distance()2188 if (distances[i] == distance) { in find_numa_distance()2290 int *distances; in sched_record_numa_dist() local2319 distances = kzalloc_objs(int, nr_levels); in sched_record_numa_dist()2320 if (!distances) in sched_record_numa_dist()2325 distances[i] = j; in sched_record_numa_dist()2327 *dist = distances; in sched_record_numa_dist()2338 int *distances, *domain_distances; in sched_init_numa() local[all …]
7 The system locality information table provides "abstract distances" between
15 the same kind of memory is found at varied distances.
24 Form 0 associativity supports only two NUMA distances (LOCAL and REMOTE).103 Since domainID can be sparse, the matrix of distances can also be effectively sparse.
12 because it can be used effectively over long distances and in electrically
11 distances with data transfer rates significantly higher than those
99 significant NUMA distances, are likely to benefit from the
597 impact is dependent on the distances between the scopes and may be more
1183 distances between watermarks are 0.1% of the available memory in the