On Fri, 2013-06-21 at 17:43 -0700, Davidlohr Bueso wrote:
> On Fri, 2013-06-21 at 17:25 -0700, Michel Lespinasse wrote:
> > On Fri, Jun 21, 2013 at 5:00 PM, Davidlohr Bueso
> > wrote:
> > > On Fri, 2013-06-21 at 16:51 -0700, Tim Chen wrote:
> > >> In this patchset, we introduce two optimizations
On Fri, 2013-06-21 at 17:25 -0700, Michel Lespinasse wrote:
> On Fri, Jun 21, 2013 at 5:00 PM, Davidlohr Bueso
> wrote:
> > On Fri, 2013-06-21 at 16:51 -0700, Tim Chen wrote:
> >> In this patchset, we introduce two optimizations to read write semaphore.
> >> The first one reduces cache bouncing o
On Fri, Jun 21, 2013 at 5:00 PM, Davidlohr Bueso wrote:
> On Fri, 2013-06-21 at 16:51 -0700, Tim Chen wrote:
>> In this patchset, we introduce two optimizations to read write semaphore.
>> The first one reduces cache bouncing of the sem->count field
>> by doing a pre-read of the sem->count and avo
On Fri, 2013-06-21 at 16:51 -0700, Tim Chen wrote:
> In this patchset, we introduce two optimizations to read write semaphore.
> The first one reduces cache bouncing of the sem->count field
> by doing a pre-read of the sem->count and avoid cmpxchg if possible.
> The second patch introduces similar
In this patchset, we introduce two optimizations to read write semaphore.
The first one reduces cache bouncing of the sem->count field
by doing a pre-read of the sem->count and avoid cmpxchg if possible.
The second patch introduces similar optimistic spining logic in
the mutex code for the writer l
5 matches
Mail list logo
