On Fri, Mar 02, 2007 at 11:52:47AM +0300, Evgeniy Polyakov ([EMAIL PROTECTED])
wrote:
> So I get my words about tree/trie implementation instead of hash table
> for socket lookup back.
Hmm, I was a bit fast to draw a line, there are some possibilities to
have faster than hash table lookup using different algorithms...
So, I ask network developers about testing environment for socket lookup
benchmarking. What would be the best test case to determine performance
of the lookup algo? Is it enough to replace algo and locking and create
say one million of connections and try to run trivial web server (that
is what I'm going to test if there will not be any better suggestion,
but I only have single-core athlon 64 with 1gb of ram as a test bed and
two core duo machines as generators, probably I can use one of them as a
test machine too. They have gigabit adapters and aree connected over
gigabit switch)?
--
Evgeniy Polyakov
-
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to [EMAIL PROTECTED]
More majordomo info at http://vger.kernel.org/majordomo-info.html
