[Beowulf] [tt] World's most powerful supercomputer goes online
Jim Lux James.P.Lux at jpl.nasa.gov Sat Sep 1 07:38:51 PDT 2007
At 06:23 AM 9/1/2007, Robert G. Brown wrote: >On Fri, 31 Aug
2007, Jim Lux wrote: >Similarly lots of other problems become
tractible to a brute force >search algorithm when you can
displose of order of 20 petaclocks worth >of cycles. (Am I
multiplying that out right?  10^7 times 2x10^9 = >2x10^16, 9 is
giga, 12 is tera, 15 is peta.  Yup.  Petacycles.).  Brute >force
searches require minimal IPCs, although I'm sure there are
>interesting problems associated with IPCs and data harvesting
when it >has to be done in "stealth" mode and not lead
investigators back to you >and when you need to make it robust
against nodes dropping out (being >cleaned by their owners) and
popping back in (as yet another virus  There is a fair amount of
literature on such communications problems.  For instance, the
classic Byzantine Generals problem deals with how  to reliably
communicate through (potentiall