On Tue, 9 Aug 2005, Marcelo Tosatti wrote: > Two hopefully useful comments: > > i) ARC and its variants requires additional information about page > replacement (namely whether the page has been reclaimed from the L1 or > L2 lists). > > How costly would it be to add this information to the hash table?
Not at all. Simply reduce the hash to 31 bits and use the remaining bit to store that value. > ii) From my reading of the patch, the provided "distance" information is > relative to each hash bucket. I'm unable to understand the distance metric > being useful if measured per-hash-bucket instead of globally? The idea is that the hash function spreads things around evenly enough for the different buckets to rotate at roughly the same speed. -- All Rights Reversed - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to [EMAIL PROTECTED] More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
