Lines Matching defs:latency
36 * the memory in the other nodes but at a higher latency than accessing their
39 * some global memory outside of the node which is higher latency.
53 * can build the latency (lgroup) topology for the machine in order to optimize
150 * 6) The latency probing related logics, which have the assumption
758 * 2) Disable latency probing logic by making sure that the flag
844 /* Update latency information among lgrps. */
850 "latency information for domain (%u).",
906 /* Update latency information among lgrps. */
913 "latency information for domain (%u).",
923 "!lgrp: failed to update latency information for "
1044 * Return latency between "from" and "to" lgroups
1046 * This latency number can only be used for relative comparison
1048 * and may not reflect the actual latency. It is platform and implementation
1062 * Return max latency for root lgroup
1078 * and we are trying to get latency from current CPU to some node.
1090 "lgrp: failed to get latency information, "
1211 * Probe memory in each node from current CPU to determine latency topology
1219 * onto the next one during each lap. The minimum latency gotten between nodes
1220 * is kept as the latency between the nodes.
1225 * local < remote, latency(a, b) == latency(b, a), etc.).
1229 * space registers and one remote memory latency since it can't tell exactly
1269 * so we can build latency topology of machine later.
1270 * This should approximate the memory latency between each node.
1289 * Keep lowest probe time as latency between nodes
1315 * latency(i, j) == latency(j, i), etc. (if possible)
1580 * Initialize min and max latency before reading SLIT or probing
1612 "?lgrp: latency probing enabled by user, "
1624 * Probe to determine latency between NUMA nodes when SLIT
1653 * accuracy of the latency topology.
1707 * (ie. latency(node0, node1) == latency(node1, node0))
1771 * and get latency between them
1776 * Skip this pair of nodes if there isn't a latency
1788 * not same as (i, j) and get latency
1798 * isn't a latency for it yet
1806 * have same latency as (i, j) or
1807 * their latency isn't close enough to
1817 * Make latency(i, j) same as
1818 * latency(k, l), try to use latency
1883 * tolerance of minimum local latency and how much
1918 * - Latencies should be symmetric (ie. latency(a, b) == latency(b, a))
1922 * - Number of occurrences of a given latency should be more than 1
1951 * (ie. latency(node0, node1) == latency(node1, node0))
2073 * Map memory in each node needed for probing to determine latency
2659 * Fill in latency matrix based on SLIT entries
2669 uint8_t latency;
2676 latency = slit_entries[(i * localities) + j];
2677 lat_stats->latencies[src][dst] = latency;
2678 if (latency < min || min == -1)
2679 min = latency;
2680 if (latency > max)
2681 max = latency;
2692 * Reinitialize (zero) latency table since SLIT doesn't look
2721 uint8_t latency;
2737 * Don't update latency info if topology has been flattened to 2 levels.
2745 * TODO: support adjusting latency information at runtime.
2751 /* Validate latency information. */
2777 latency = sli_info[i];
2778 lat_stats->latencies[src][dst] = latency;
2779 if (latency < min || min == -1)
2780 min = latency;
2781 if (latency > max)
2782 max = latency;
2785 latency = sli_info[sli_cnt + i];
2786 lat_stats->latencies[dst][src] = latency;
2787 if (latency < min || min == -1)
2788 min = latency;
2789 if (latency > max)
2790 max = latency;