https://github.com/torvalds/linux
Revision de3cb945db4d8eb3b046dc7a5ea89a893372750c authored by Chris Mason on 04 March 2013, 22:13:31 UTC, committed by Chris Mason on 07 March 2013, 12:52:40 UTC
The delayed inode code batches up changes to the btree in hopes of doing
them in bulk.  As the changes build up, processes kick off worker
threads and wait for them to make progress.

The current code kicks off an async work queue item for each delayed
node, which creates a lot of churn.  It also uses a fixed 1 HZ waiting
period for the throttle, which allows us to build a lot of pending
work and can slow down the commit.

This changes us to watch a sequence counter as it is bumped during the
operations.  We kick off fewer work items and have each work item do
more work.

Signed-off-by: Chris Mason <chris.mason@fusionio.com>
1 parent 3a01aa7
History
Tip revision: de3cb945db4d8eb3b046dc7a5ea89a893372750c authored by Chris Mason on 04 March 2013, 22:13:31 UTC
Btrfs: improve the delayed inode throttling
Tip revision: de3cb94
File Mode Size
kvm

back to top