Messages in this thread | | | Subject | Re: [PATCH] Radix-tree pagecache for 2.5 | Date | Thu, 31 Jan 2002 15:32:24 +0000 (GMT) | From | Alan Cox <> |
| |
> Mathematically the hashtable complexity is O(N). But probabilistically > with the tuning we do on the hashtable size, the collisions will be > nearly zero for most buckets for of most workloads. Despite the worst > case is with all the pagecache and swapcache queued in a single linked > list :).
Providing it handles the worst case. Some of the hash table inputs appear to be user controllable so an end user can set out to get worst case behaviour 8( - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |