[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <f2b55d220702221831p23122caawa4f0fb4210a09b87@mail.gmail.com>
Date: Thu, 22 Feb 2007 18:31:29 -0800
From: "Michael K. Edwards" <medwards.linux@...il.com>
To: "linux@...izon.com" <linux@...izon.com>
Cc: johnpol@....mipt.ru, akepner@....com, bcrl@...ck.org,
dada1@...mosbay.com, davem@...emloft.net, netdev@...r.kernel.org
Subject: Re: Extensible hashing and RCU
On 22 Feb 2007 18:49:00 -0500, linux@...izon.com <linux@...izon.com> wrote:
> The rehash-every-10-minutes detail is theoretically unnecessary,
> but does cover the case where a would-be attacker *does* get a chance
> to look at a machine, such as by using routing delays to measure the
> effectiveness of a collision attempt.
AOL -- and that's one of the reasons why RCUing hashes is a nightmare
in practice, if you care about smooth peristalsis. Again, the
resizing headache is just the canary in the coal mine.
> If you want to test your distribution for randomness, go have a look
> at Knuth volume 2 (seminumerical algorithms) and see the discussion of
> the Kolmogorov-Smirnov test. Some lumpiness is *expected* in a truly
> random distribution.
Ah, Kolmogorov-Smirnov, the astronomer's friend. Somewhere on a DAT
in my garage lies a rather nice implementation of K-S tests on
censored data for the Mirella/Mirage Forth image analysis package. If
you want something industrial-strength, easy to use, and pretty
besides, I recommend SM (http://www.astro.princeton.edu/~rhl/sm/),
which will cost you $500 U.S. for a department-scale license. SM so
utterly exceeds the capabilities of gnuplot it isn't even funny. But
then, while you don't always get what you pay for, you rarely fail to
pay for what you get, sooner or later, in one currency or another.
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