Re: [RFC PATCH v2 0/4] ext4: extents status tree shrinker improvement

[Theodore Ts'o <tytso@mit.edu>]

On Mon, Apr 21, 2014 at 10:46:46PM +0800, Zheng Liu wrote:
> I am not sure that I fully understand your meaning.  AFAIU, we have a
> list which uses RR scheme to shrink extent caches.  In this list it
> tracks written/unwrittten/hole extent caches.  When the shrinker tries
> to reclaim some objects, it will scan this list and reclaim all extent
> caches whose ref count are less than a number.  Meanwhile the ref count
> of rest caches will be decreased and moved into active list.  In active
> list it tracks all delayed extent caches, precached extent caches and
> other caches that have been promoted.  The shrinker uses LRU algorithm
> to reclaim objects from active list.  Please let me know if I miss
> something.

Yes, that's right.  I misunderstood your analogy to how it's like the
MM.  It is much like the page aging algorithm in that the work done by
the MMU is very minimal, and most of the work is done in the scanning
algorithm.  It might be that a pure "clock algorithm", would work
better than something which is closer to a GC like scheme with a
"tenured" and "nursery" space".  It certainly would be simpler to
implement.

So it's certainly something that's worth considering.

Cheers,

						- Ted