Le jeudi 20 mai 2010 à 22:43 +0530, Anand Raj Manickam a écrit : > Suppose , if there are around 50,000 connections adds and 50,000 > connection deletes on 1 million conncurrent conntrack entry table we > have a scalabilty problem ? > Yes, unless you use one cpu. > The reason why i m posting this question is on the ablity of hash > tables on 1 million entries vs rb trees handling 1 million entries . Do you have an idea of the depth of a rb tree with 1 million entries ? Well sized hash table is about 25 x faster than a rb tree in this case for pure lookups, and inserts and deletes in hash table are about 100x faster in this case. hash table : one or two cache misses per lookup or inserts/deletes rbtree with one million entries : about 25 caches misses per lookup, and maybe 100 cache misses per insert/delete. -- To unsubscribe from this list: send the line "unsubscribe netfilter-devel" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
