04 AM
>>> To: dev at dpdk.org
>>> Subject: [dpdk-dev] [PATCH v2] mempool: improve cache search
>>>
>>> The current way has a few problems:
>>>
>>> - if cache->len < n, we copy our elements into the cache first, then
>>>into obj_ta
, July 01, 2015 10:04 AM
> >>To: dev at dpdk.org
> >>Subject: [dpdk-dev] [PATCH v2] mempool: improve cache search
> >>
> >>The current way has a few problems:
> >>
> >>- if cache->len < n, we copy our elements into the cache first, then
> &g
On 02/07/15 18:07, Ananyev, Konstantin wrote:
>
>
>> -Original Message-
>> From: dev [mailto:dev-bounces at dpdk.org] On Behalf Of Zoltan Kiss
>> Sent: Wednesday, July 01, 2015 10:04 AM
>> To: dev at dpdk.org
>> Subject: [dpdk-dev] [PATCH v2] mem
On 07/03/2015 03:32 PM, Olivier MATZ wrote:
>
>
> On 07/01/2015 11:03 AM, Zoltan Kiss wrote:
>> The current way has a few problems:
>>
>> - if cache->len < n, we copy our elements into the cache first, then
>> into obj_table, that's unnecessary
>> - if n >= cache_size (or the backfill fails),
On 07/01/2015 11:03 AM, Zoltan Kiss wrote:
> The current way has a few problems:
>
> - if cache->len < n, we copy our elements into the cache first, then
> into obj_table, that's unnecessary
> - if n >= cache_size (or the backfill fails), and we can't fulfil the
> request from the ring alone
> -Original Message-
> From: dev [mailto:dev-bounces at dpdk.org] On Behalf Of Zoltan Kiss
> Sent: Wednesday, July 01, 2015 10:04 AM
> To: dev at dpdk.org
> Subject: [dpdk-dev] [PATCH v2] mempool: improve cache search
>
> The current way has a few problems:
>
&
The current way has a few problems:
- if cache->len < n, we copy our elements into the cache first, then
into obj_table, that's unnecessary
- if n >= cache_size (or the backfill fails), and we can't fulfil the
request from the ring alone, we don't try to combine with the cache
- if refill fail
7 matches
Mail list logo