| To: | shemminger@xxxxxxxx |
|---|---|
| Subject: | Re: Route cache performance under stress |
| From: | "David S. Miller" <davem@xxxxxxxxxx> |
| Date: | Mon, 09 Jun 2003 09:37:55 -0700 (PDT) |
| Cc: | xerox@xxxxxxxxxx, hadi@xxxxxxxxxxxxxxxx, sim@xxxxxxxxxxxxx, fw@xxxxxxxxxxxxx, netdev@xxxxxxxxxxx, linux-net@xxxxxxxxxxxxxxx, Robert.Olsson@xxxxxxxxxxx |
| In-reply-to: | <20030609092327.41899cb5.shemminger@osdl.org> |
| References: | <001801c32e50$57ef0750$4a00000a@badass> <20030608.232827.88487519.davem@redhat.com> <20030609092327.41899cb5.shemminger@osdl.org> |
| Sender: | netdev-bounce@xxxxxxxxxxx |
From: Stephen Hemminger <shemminger@xxxxxxxx> Date: Mon, 9 Jun 2003 09:23:27 -0700 Has anyone looked into using Judy array's to speedup the route cache. HP has opened it up (see http://sourceforge.net/projects/judy ) and it should have better scaling for these type of attacks. Like all such seemingly promising schemes, insert/retrieve are optimized at the expense of delete. I normally don't even look at such algorithms anymore, they all are amazing if you only build tables and look for things in them but are unusable when O(1) insert/delete/lookup are absolutely required. |
| Previous by Date: | Re: Route cache performance under stress, Simon Kirby |
|---|---|
| Next by Date: | Re: [PATCH] switch skfp over to initcalls, David S. Miller |
| Previous by Thread: | Re: Route cache performance under stress, Stephen Hemminger |
| Next by Thread: | Re: Route cache performance under stress, Simon Kirby |
| Indexes: | [Date] [Thread] [Top] [All Lists] |