2015-07-23 17:12, Pablo de Lara:
> With the new hash implementation, the minimum lookup burst size
> to get good performance is 8, since its internal pipeline
> consists of 4 stages of 2 entries each, so to avoid
> duplication, burst size should be 8 or more entries.
>
> Signed-off-by: Pablo de La
> -Original Message-
> From: Xu, Qian Q
> Sent: Friday, July 24, 2015 2:09 AM
> To: De Lara Guarch, Pablo; Qiu, Michael; dev at dpdk.org
> Subject: RE: [dpdk-dev] [PATCH] examples/l3fwd: increase lookup burst size
> to 8
>
> And this patch will be only related to
: [dpdk-dev] [PATCH] examples/l3fwd: increase lookup burst size to 8
Hi Michael,
> -Original Message-
> From: Qiu, Michael
> Sent: Thursday, July 23, 2015 6:26 PM
> To: De Lara Guarch, Pablo; dev at dpdk.org
> Subject: RE: [dpdk-dev] [PATCH] examples/l3fwd: increase lookup bur
Hi Michael,
> -Original Message-
> From: Qiu, Michael
> Sent: Thursday, July 23, 2015 6:26 PM
> To: De Lara Guarch, Pablo; dev at dpdk.org
> Subject: RE: [dpdk-dev] [PATCH] examples/l3fwd: increase lookup burst size
> to 8
>
> Hi, Pablo
>
> Is there any pe
Hi, Pablo
Is there any performance data for this change?
Thanks,
Michael
-Original Message-
From: dev [mailto:dev-boun...@dpdk.org] On Behalf Of Pablo de Lara
Sent: Thursday, July 23, 2015 9:12 AM
To: dev at dpdk.org
Subject: [dpdk-dev] [PATCH] examples/l3fwd: increase lookup burst size
With the new hash implementation, the minimum lookup burst size
to get good performance is 8, since its internal pipeline
consists of 4 stages of 2 entries each, so to avoid
duplication, burst size should be 8 or more entries.
Signed-off-by: Pablo de Lara
---
examples/l3fwd/main.c | 234
6 matches
Mail list logo