[149313] in cryptography@c2.net mail archive
Re: [Cryptography] cheap sources of entropy
daemon@ATHENA.MIT.EDU (Bill Frantz)
Mon Feb 3 00:01:06 2014
X-Original-To: cryptography@metzdowd.com
Date: Sun, 2 Feb 2014 20:36:04 -0800
From: Bill Frantz <frantz@pwpconsult.com>
To: cryptography@metzdowd.com
In-Reply-To: <201402030334.s133YlFT009166@new.toad.com>
Errors-To: cryptography-bounces+crypto.discuss=bloom-picayune.mit.edu@metzdowd.com
My experience with working on several OS kernels is that OS
scheduling is a black art. Its a lot more arcane than cryptography.
If I were working on the scheduler for a modern VM hypervisor, I
would spend considerable effort trying to maximize the
efficiency of the L1 and L2 caches. Disk I/O just doesn't count.
If you have to wait for a disk operation, you're in a long-term
penalty box.
Now, if you can measure program execution time accurately enough
to determine the L1 and L2 cache misses, they might be a good
source of bits unknown to outside observers. :-)
Cheers - Bill
-----------------------------------------------------------------------
Bill Frantz | I like the farmers' market | Periwinkle
(408)356-8506 | because I can get fruits and | 16345
Englewood Ave
www.pwpconsult.com | vegetables without stickers. | Los Gatos,
CA 95032
_______________________________________________
The cryptography mailing list
cryptography@metzdowd.com
http://www.metzdowd.com/mailman/listinfo/cryptography
