This patch series introduces predictable RSS feature.
It is based on the idea of searching for partial hash collisions
within Toeplitz hash.
The Toeplitz hash function is a homomorphism between (G, ^) and (H, ^),
where (G, ^) - is a group of tuples and (H, ^) is a group of hashes
with respect to X
11/04/2021 20:51, Medvedkin, Vladimir:
> On 08/04/2021 18:56, Stephen Hemminger wrote:
> >> app/test/test_thash.c | 468 +++-
> >> lib/librte_hash/meson.build | 3 +-
> >> lib/librte_hash/rte_thash.c | 637
> >>
>
Hi Thomas,
пт, 22 окт. 2021 г. в 22:56, Thomas Monjalon :
> 11/04/2021 20:51, Medvedkin, Vladimir:
> > On 08/04/2021 18:56, Stephen Hemminger wrote:
> > >> app/test/test_thash.c | 468 +++-
> > >> lib/librte_hash/meson.build | 3 +-
> > >> lib/librte_hash/r
On Tue, 6 Apr 2021 20:50:40 +0100
Vladimir Medvedkin wrote:
> This patch series introduces predictable RSS feature.
> It is based on the idea of searching for partial hash collisions
> within Toeplitz hash.
>
> The Toeplitz hash function is a homomorphism between (G, ^) and (H, ^),
> where (G,
> -Original Message-
> From: Medvedkin, Vladimir
> Sent: Tuesday, April 6, 2021 12:51 PM
> To: dev@dpdk.org
> Cc: Ananyev, Konstantin ; Chilikin, Andrey
> ; Kinsella, Ray ; Wang,
> Yipeng1 ; Gobriel, Sameh
> ; Richardson, Bruce
>
> Subject: [PATCH v2 0/3] Predictable RSS feature
>
> This
Hi Stephen,
Thanks for the feedback,
On 08/04/2021 18:56, Stephen Hemminger wrote:
On Tue, 6 Apr 2021 20:50:40 +0100
Vladimir Medvedkin wrote:
This patch series introduces predictable RSS feature.
It is based on the idea of searching for partial hash collisions
within Toeplitz hash.
The To
Hi Yipeng,
Thanks for the review,
On 10/04/2021 03:32, Wang, Yipeng1 wrote:
-Original Message-
From: Medvedkin, Vladimir
Sent: Tuesday, April 6, 2021 12:51 PM
To: dev@dpdk.org
Cc: Ananyev, Konstantin ; Chilikin, Andrey
; Kinsella, Ray ; Wang,
Yipeng1 ; Gobriel, Sameh
; Richardson, Bruc
7 matches
Mail list logo
