netdev - Re: Extensible hashing and RCU

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite for Android: free password hash cracker in your pocket

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-Id: <20070221.053721.112287244.davem@davemloft.net>
Date:	Wed, 21 Feb 2007 05:37:21 -0800 (PST)
From:	David Miller <davem@...emloft.net>
To:	dada1@...mosbay.com
Cc:	andi@...stfloor.org, johnpol@....mipt.ru, akepner@....com,
	linux@...izon.com, netdev@...r.kernel.org, bcrl@...ck.org
Subject: Re: Extensible hashing and RCU

From: Eric Dumazet <dada1@...mosbay.com>
Date: Wed, 21 Feb 2007 14:19:30 +0100

> Now, when the rate of lookups/inserts/delete is high, with totally random 
> endpoints and cache *always* cold , 'tree structures' are not welcome (not 
> cache friendly)

But what about if tree lookup were free :-)

This is why I consider Robert Olsson's trash work the most promising,
if we stick sockets into his full flow identified routing cache trie
entries, we can eliminate lookup altogether.

Just like how he already uses traffic inspection to kill cache entries
when FIN shutdown sequence is snooped, we can explicitly flush such
entries when socket is closed fully on local system.

Really, possibilities are truly endless with that thing.
-
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