lkml.org 
[lkml]   [2013]   [Jul]   [16]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: Performance regression from switching lock to rw-sem for anon-vma tree
From
Date
On Tue, 2013-07-02 at 08:45 +0200, Ingo Molnar wrote:
> * Tim Chen <tim.c.chen@linux.intel.com> wrote:
>
> > On Sat, 2013-06-29 at 09:12 +0200, Ingo Molnar wrote:
> > > * Tim Chen <tim.c.chen@linux.intel.com> wrote:
> > >
> > > > > If my analysis is correct so far then it might be useful to add two
> > > > > more stats: did rwsem_spin_on_owner() fail because lock->owner == NULL
> > > > > [owner released the rwsem], or because owner_running() failed [owner
> > > > > went to sleep]?
> > > >
> > > > Ingo,
> > > >
> > > > I tabulated the cases where rwsem_spin_on_owner returns false and causes
> > > > us to stop spinning.
> > > >
> > > > 97.12% was due to lock's owner switching to another writer
> > > > 0.01% was due to the owner of the lock sleeping
> > > > 2.87% was due to need_resched()
> > > >
> > > > I made a change to allow us to continue to spin even when lock's owner
> > > > switch to another writer. I did get the lock to be acquired now mostly
> > > > (98%) via optimistic spin and lock stealing, but my benchmark's
> > > > throughput actually got reduced by 30% (too many cycles spent on useless
> > > > spinning?).
> > >
> > > Hm, I'm running out of quick ideas :-/ The writer-ends-spinning sequence
> > > is pretty similar in the rwsem and in the mutex case. I'd have a look at
> > > one more detail: is the wakeup of another writer in the rwsem case
> > > singular, is only a single writer woken? I suspect the answer is yes ...
> >
> > Ingo, we can only wake one writer, right? In __rwsem_do_wake, that is
> > indeed the case. Or you are talking about something else?
>
> Yeah, I was talking about that, and my understanding and reading of the
> code says that too - I just wanted to make sure :-)
>
> > >
> > > A quick glance suggests that the ordering of wakeups of waiters is the
> > > same for mutexes and rwsems: FIFO, single waiter woken on
> > > slowpath-unlock. So that shouldn't make a big difference.
> >

Ingo,

I tried MCS locking to order the writers but
it didn't make much difference on my particular workload.
After thinking about this some more, a likely explanation of the
performance difference between mutex and rwsem performance is:

1) Jobs acquiring mutex put itself on the wait list only after
optimistic spinning. That's only 2% of the time on my
test workload so they access the wait list rarely.

2) Jobs acquiring rw-sem for write *always* put itself on the wait
list first before trying lock stealing and optimistic spinning.
This creates a bottleneck at the wait list, and also more
cache bouncing.

One possible optimization is to delay putting the writer on the
wait list till after optimistic spinning, but we may need to keep
track of the number of writers waiting. We could add a WAIT_BIAS
to count for each write waiter and remove the WAIT_BIAS each time a
writer job completes. This is tricky as I'm changing the
semantics of the count field and likely will require a number of changes
to rwsem code. Your thoughts on a better way to do this?

Thanks.

Tim



\
 
 \ /
  Last update: 2013-07-16 21:01    [W:0.256 / U:0.692 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site