On Tue, Aug 21, 2018 at 02:48:47PM -0400, Chris Mason wrote: > On 21 Aug 2018, at 14:15, Liu Bo wrote: > > > On Tue, Aug 21, 2018 at 01:54:11PM -0400, Chris Mason wrote: > > > On 16 Aug 2018, at 17:07, Liu Bo wrote: > > > > > > > The lock contention on btree nodes (esp. root node) is apparently a > > > > bottleneck when there're multiple readers and writers concurrently > > > > trying to access them. Unfortunately this is by design and it's not > > > > easy to fix it unless with some complex changes, however, there is > > > > still some room. > > > > > > > > With a stable workload based on fsmark which has 16 threads creating > > > > 1,600K files, we could see that a good amount of overhead comes from > > > > switching path between spinning mode and blocking mode in > > > > btrfs_search_slot(). > > > > > > > > Patch 1 provides more details about the overhead and test > > > > results from > > > > fsmark and dbench. > > > > Patch 2 kills leave_spinning due to the behaviour change from > > > > patch 1. > > > > > > This is really interesting, do you have numbers about how often we > > > are able > > > to stay spinning? > > > > > > > I didn't gather how long we stay spinning, > > I'm less worried about length of time spinning than I am how often we're > able to call btrfs_search_slot() without ever blocking. If one caller ends > up going into blocking mode, it can cascade into all of the other callers, > which can slow things down in low-to-medium contention workloads. > > The flip side is that maybe the adaptive spinning in the mutexes is good > enough now and we can just deleting the spinning completely. >
hmm, looks like the current mutex with adaptive spinning doesn't offer read/write version, meaning we're not able to simple drop rwlock. thanks, -liubo > > but I was tracking > > > > (1) how long a read lock or write lock can wait until it gets the > > lock, with vanilla kernel, for read lock, it could be up to 10ms while > > for write lock, it could be up to 200ms. > > Nice, please add the stats to the patch descriptions, both before and after. > I'd love to see a histogram like you can get out of bcc's argdist.py. > > -chris
