[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <f2b55d220702181323l5d2640a4g18df6d1ee051e987@mail.gmail.com>
Date: Sun, 18 Feb 2007 13:23:20 -0800
From: "Michael K. Edwards" <medwards.linux@...il.com>
To: "Eric Dumazet" <dada1@...mosbay.com>
Cc: "Evgeniy Polyakov" <johnpol@....mipt.ru>, akepner@....com,
linux@...izon.com, davem@...emloft.net, netdev@...r.kernel.org,
bcrl@...ux.intel.com
Subject: Re: Extensible hashing and RCU
A better data structure for RCU, even with a fixed key space, is
probably a splay tree. Much less vulnerable to cache eviction DDoS
than a hash, because the hot connections get rotated up into non-leaf
layers and get traversed enough to keep them in the LRU set. But I am
not a data structures guru; a stratified tree or van Emde-Boas
priority queue might be a better choice. RCU splay tree has lots of
other potential applications inside the kernel, so it would make a fun
project for someone with time to burn.
Cheers,
- Michael
-
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Powered by blists - more mailing lists