| /dpdk/examples/qos_sched/ |
| H A D | stats.c | 18 uint32_t average; in qavg_q() local
42 average = 0; in qavg_q()
45 average += qlen; in qavg_q()
49 average /= qavg_ntimes; in qavg_q()
85 average = 0; in qavg_tcpipe()
105 average /= qavg_ntimes; in qavg_tcpipe()
139 average = 0; in qavg_pipe()
152 average /= qavg_ntimes; in qavg_pipe()
185 average = 0; in qavg_tcsubport()
222 average /= qavg_ntimes; in qavg_tcsubport()
[all …]
|
| /dpdk/doc/guides/sample_app_ug/ |
| H A D | qos_scheduler.rst | 164 The commands that can be used for measuring average queue size are:
166 * qavg port X subport Y: Show average queue size per subport.
168 * qavg port X subport Y tc Z: Show average queue size per subport for a specific traffic class.
170 * qavg port X subport Y pipe Z: Show average queue size per pipe.
172 * qavg port X subport Y pipe Z tc A: Show average queue size per pipe for a specific traffic clas…
174 * qavg port X subport Y pipe Z tc A q B: Show average queue size of a specific queue.
|
| H A D | rxtx_callbacks.rst | 17 also display the average latency since the packet was timestamped in hardware,
125 transmitted the average cycle count per packet is printed out and the counters
|
| H A D | eventdev_pipeline.rst | 107 packets received, runtime in milliseconds, average mpps, and current mpps.
|
| H A D | l3_forward_power_man.rst | 197 or if the average packet per iteration is less than expectation, the frequency is decreased by one …
|
| H A D | vm_power_management.rst | 749 if between the average and maximum thresholds.
|
| /dpdk/doc/guides/prog_guide/ |
| H A D | qos_framework.rst | 1189 Depending on whether the average queue size is below, above or in between these thresholds,
1306 avg (average queue size) and count (number of packets since the last drop) are run-time values,
1324 or slowly the average queue size output responds to changes in the actual queue size input.
1336 * *avg* = average queue size
1468 * Compares the average queue size with the minimum and maximum thresholds
1475 An initial drop probability is calculated based on the average queue size,
1493 * *avg* = average queue size
1500 If the average queue size is below the minimum threshold, an arriving packet is enqueued.
1501 If the average queue size is at or above the maximum threshold, an arriving packet is dropped.
1502 If the average queue size is between the minimum and maximum thresholds,
[all …]
|
| H A D | metrics_lib.rst | 175 average and peak bit-rates for each active port (i.e. network device).
240 processing by a DPDK application, reporting the minimum, average,
|
| H A D | writing_efficient_code.rst | 138 but the end-to-end latency of an average packet will typically increase as a result.
139 Similarly, the application can be tuned to have, on average,
|
| H A D | lpm6_lib.rst | 62 It can vary from 1 to 14 memory accesses, with 5 being the average value for the lengths
|
| H A D | ring_lib.rst | 393 update and improves average enqueue/dequeue times on overcommitted systems.
|
| H A D | efd_lib.rst | 70 requires only K/n keys to be remapped on average, where K is the number of
|
| H A D | hash_lib.rst | 258 Last values on the tables above are the average maximum table
|
| H A D | env_abstraction_layer.rst | 784 - It has worse average-case performance than the non-preemptive rte_ring, but
|
| /dpdk/doc/guides/mempool/ |
| H A D | stack.rst | 31 The standard stack outperforms the lock-free stack on average, however the
|
| /dpdk/doc/guides/faq/ |
| H A D | faq.rst | 79 but the end-to-end latency of an average packet typically increases as a result.
80 Similarly, the application can be tuned to have, on average, a low end-to-end latency at the cost o…
|
| /dpdk/doc/guides/tools/ |
| H A D | flow-perf.rst | 23 computes an average time across all windows.
80 (i.e., once every 100000 flow rules) and then report an average
|
| H A D | testeventdev.rst | 405 value to compute the average latency to a forward packet.
|
| /dpdk/doc/guides/rel_notes/ |
| H A D | release_20_05.rst | 36 average enqueue/dequeue times on overcommitted systems.
|
| H A D | release_17_05.rst | 251 jitter and latency. For latency the minimum, average, and maximum is
|
| /dpdk/doc/guides/contributing/ |
| H A D | patches.rst | 675 An average cycle lasts 3 months and have 4 release candidates in the last month.
|
| /dpdk/doc/guides/nics/ |
| H A D | mlx5.rst | 872 the average delay between beginning of the transmitting descriptor processing
|