| To: | Wang Jian <lark@xxxxxxxxxxxx> |
|---|---|
| Subject: | Re: [PATCH] improvement on net/sched/cls_fw.c's hash function |
| From: | jamal <hadi@xxxxxxxxxx> |
| Date: | 05 Apr 2005 12:11:35 -0400 |
| Cc: | Thomas Graf <tgraf@xxxxxxx>, netdev <netdev@xxxxxxxxxxx> |
| In-reply-to: | <20050405213023.0256.LARK@xxxxxxxxxxxx> |
| Organization: | jamalopolous |
| References: | <20050405202039.0250.LARK@xxxxxxxxxxxx> <1112705689.1088.209.camel@xxxxxxxxxxxxxxxx> <20050405213023.0256.LARK@xxxxxxxxxxxx> |
| Reply-to: | hadi@xxxxxxxxxx |
| Sender: | netdev-bounce@xxxxxxxxxxx |
Hi Wang, On Tue, 2005-04-05 at 10:18, Wang Jian wrote: > I am not saying that we must use jenkins. We may use a less expensive > hash function than jenkins, but better than & 0xFF. > Sure; point is as long as it doesnt destroy the common use in place. >Anyway, I have done userspace test for jhash. The following test > is done in a AMD Athlon 800MHz without other CPU load. > No, the test i was asking for is to show distribution of the hash not how long it took (which is also an ok test). i.e if you fed the jenkins hash with 256 buckets - lets pick the number 1024 samples of the data you showed earlier for how fwmark looks like, how well would the result look like. And what if you fed it with something like 1024 incremental fwmark from say 1..1024? cheers, jamal |
| Previous by Date: | Re: [PATCH] network configs: disconnect network options from drivers, Sam Ravnborg |
|---|---|
| Next by Date: | [07/08] [TCP] Fix BIC congestion avoidance algorithm error, Greg KH |
| Previous by Thread: | Re: [PATCH] improvement on net/sched/cls_fw.c's hash function, Wang Jian |
| Next by Thread: | Re: [PATCH] improvement on net/sched/cls_fw.c's hash function, Wang Jian |
| Indexes: | [Date] [Thread] [Top] [All Lists] |