On 2/23/07, Zach Brown <[EMAIL PROTECTED]> wrote:
I'd love to see a generic implementation of RCU hashing that subsystems can then take advantage of. It's long been on the fun side of my todo list. The side I never get to :/.
There's an active thread on netdev about implementing an RCU hash. I'd suggest a 2-left (or possibly even k-left) hash for statistical reasons discussed briefly there, and in greater depth in a paper by Michael Mitzenmacher at www.eecs.harvard.edu/~michaelm/NEWWORK/postscripts/iproute.ps. Despite his paper's emphasis on hardware parallelism, there's a bigger win associated with Poisson statistics and decreasing occupation fraction (and therefore collision probability) in successive hashes. Cheers, - Michael - 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/
