11/11/2018 08:48, Jerin Jacob:
> >
> > The lock-free algorithm has caused significant lookup
> > performance regression for certain use cases. The
> > regression is attributed to the use of non-relaxed
> > memory orderings. 2 versions of the lookup functions
> > are created. One that uses the RW l
> > Subject: [PATCH v2 1/1] hash: separate lf and rw lock lookup code
> > paths
> >
> > The lock-free algorithm has caused significant lookup performance
> > regression for certain use cases. The regression is attributed to the
> > use of non-relaxed memory orderings. 2 versions of the lookup
> > f
> -Original Message-
> From: Honnappa Nagarahalli [mailto:honnappa.nagaraha...@arm.com]
> Sent: Saturday, November 10, 2018 10:56 AM
> To: Richardson, Bruce ; De Lara Guarch, Pablo
>
> Cc: dev@dpdk.org; jerin.ja...@caviumnetworks.com;
> hemant.agra...@nxp.com; chao...@linux.vnet.ibm.com; W
-Original Message-
> Date: Sat, 10 Nov 2018 12:55:34 -0600
> From: Honnappa Nagarahalli
> To: bruce.richard...@intel.com, pablo.de.lara.gua...@intel.com
> CC: dev@dpdk.org, jerin.ja...@caviumnetworks.com, hemant.agra...@nxp.com,
> chao...@linux.vnet.ibm.com, yipeng1.w...@intel.com,
> dha
The lock-free algorithm has caused significant lookup
performance regression for certain use cases. The
regression is attributed to the use of non-relaxed
memory orderings. 2 versions of the lookup functions
are created. One that uses the RW lock and the one that
is lock-free. This restores the per
5 matches
Mail list logo
