[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <ebcb37f6-ae2f-b9fa-4911-e6b135cd65e8@linux.intel.com>
Date: Thu, 31 Jan 2019 11:18:47 -0800
From: Tim Chen <tim.c.chen@...ux.intel.com>
To: Steve Sistare <steven.sistare@...cle.com>, mingo@...hat.com,
peterz@...radead.org
Cc: subhra.mazumdar@...cle.com, dhaval.giani@...cle.com,
daniel.m.jordan@...cle.com, pavel.tatashin@...rosoft.com,
matt@...eblueprint.co.uk, umgwanakikbuti@...il.com,
riel@...hat.com, jbacik@...com, juri.lelli@...hat.com,
valentin.schneider@....com, vincent.guittot@...aro.org,
quentin.perret@....com, linux-kernel@...r.kernel.org
Subject: Re: [PATCH v4 01/10] sched: Provide sparsemask, a reduced contention
bitmap
On 12/6/18 1:28 PM, Steve Sistare wrote:
> Provide struct sparsemask and functions to manipulate it. A sparsemask is
> a sparse bitmap. It reduces cache contention vs the usual bitmap when many
> threads concurrently set, clear, and visit elements, by reducing the number
> of significant bits per cacheline. For each cacheline chunk of the mask,
> only the first K bits of the first word are used, and the remaining bits
> are ignored, where K is a creation time parameter. Thus a sparsemask that
> can represent a set of N elements is approximately (N/K * CACHELINE) bytes
> in size.
>
> This type is simpler and more efficient than the struct sbitmap used by
> block drivers.
>
> Signed-off-by: Steve Sistare <steven.sistare@...cle.com>
Steve,
We did a test of this patch set with an OLTP benchmark using Oracle database
on a 2 socket SKX platform with 2 X 28 cores. The patchset boosted the
performance by 3.5%.
The percentage of cpu idle time is lowered by 5%,
with user time increased by 4% and kernel time increased by 1%,
indicating a better cpu utilization overall.
The performance looks encouraging.
Thanks.
Tim
Powered by blists - more mailing lists