This is totally offtopic. We were _not_ talking about other algorithms. We
were _only_ talking about _when_ the 1 bit of aging I introduced with my
algorithm improves performance at max. My answer is that the max performance
improvement happens when there's the _highest_ VFS load in background and you
disagreed. Everything else has nothing to do with this our previous discussion
so your above reply partly still doesn't make sense to me.
Talking about the new topic you introduced above with your offtopic reply, I
think that for a thing like dcache 1 bit of aging is more than enough
(and btw, in my 2.4.x VM tree I put a 1 bit of aging also in the icache). In
case you didn't realized the frequency the dcache gets recycled completly is
much much much lower than the frequency something like the pagecache can be
recycled completly. So you have relatively plenty of time before the referenced
dentries gets collected.
Andrea
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
Please read the FAQ at http://www.tux.org/lkml/