Old I Say Thee Nay!

Stupid links, random comments, and occasionally even sustained insight.

Wednesday, February 16, 2005

One final note: I've got a timeframe for 2^69 operations. Given a 4GHz processor and assuming that one operation can be undertaken every clock cycle, it will take 2^37 seconds (since 4GHz = 2^32 Hz). That's a little more than 4355 years, and I'm perversely counting leap years. Assuming you can turn this into a distributed algorithm; if you've got a shitload of money, you can parallelize the process to your hearts content and crack it in significantly less time. Although I'd recommend waiting a while: according to (a simplified version of) Moore's Law (processor speeds double every 18 months; Moore actually said something else very closely related), get 1024 processors in a little more than 15 years and you'll be able to do it in a day and a half.

2 Comments:

  • At 10:04 a.m., Blogger Justin Ng said…

    Drop that into a mapreduce and run on 10,000 machines. Who needs Moore's Law?

     
  • At 10:31 a.m., Blogger Mark Cook said…

    10,000 is only about 2^3 times as much as 1024; so that doesn't really shave an appreciable amount of time off any calculation for right now, but it does speed up the day-and-a-half thing to ten or eleven years.

    Besides, who has 10,000 machines sitting around like that? *cough*

     

Post a Comment

<< Home