Slashdot Mirror


New Pi Computation Record Using a Desktop PC

hint3 writes "Fabrice Bellard has calculated Pi to about 2.7 trillion decimal digits, besting the previous record by over 120 billion digits. While the improvement may seem small, it is an outstanding achievement because only a single desktop PC, costing less than $3,000, was used — instead of a multi-million dollar supercomputer as in the previous records."

8 of 204 comments (clear)

  1. One thing to say by DirtyCanuck · · Score: 5, Informative

    From the FAQ

    "How does your record compares to the previous one ?
    The previous Pi computation record of about 2577 billion decimal digits was published by Daisuke Takahashi on August 17th 2009. The main computation lasted 29 hours and used 640 nodes of a T2K Open Supercomputer (Appro Xtreme-X3 Server). Each node contains 4 Opteron Quad Core CPUs at 2.3 GHz, giving a peak processing power of 94.2 Tflops (trillion floating point operations per second).

    My computation used a single Core i7 Quad Core CPU at 2.93 GHz giving a peak processing power of 46.9 Gflops. So the supercomputer is about 2000 times faster than my computer. However, my computation lasted 116 days, which is 96 times slower than the supercomputer for about the same number of digits. So my computation is roughly 20 times more efficient. It can be explained by the following facts:

            * The Pi computation is I/O bound, so it needs very high communication speed between the nodes on a parallel supercomputer. So the full power of the supercomputer cannot really be used.
            * The algorithm I used (Chudnovsky series evaluated using the binary splitting algorithm) is asymptotically slower than the Arithmetic-Geometric Mean algorithm used by Daisuke Takahashi, but it makes a more efficient use of the various CPU caches, so in practice it can be faster. Moreover, some mathematical tricks were used to speed up the binary splitting. " ( http://bellard.org/pi/pi2700e9/faq.html )

    Mathematical and Programming Ownage.

  2. Finally! by pEBDr · · Score: 5, Funny

    Now I can finally get somewhat reasonable precision when calculating the radius of stuff!

  3. this guy has a pretty impressive track record by Trepidity · · Score: 5, Informative

    For those not previously familiar with Fabrice Bellard, he's known for:

    • LZEXE, very popular in the early 1990s as the first EXE-shrinker for DOS, or at least the first widely available one
    • ffmpeg, video decoding library which he started and headed for a number of years
    • QEMU, dynamic-translating generic emulator
    1. Re:this guy has a pretty impressive track record by msclrhd · · Score: 5, Informative

      He also wrote the Obfuscated Tiny C Compiler (http://bellard.org/otcc/) in 2002 for the Obfuscated C contest, where otcc could compile itself. This became the Tiny C Compiler (TCC) which was picked up by Robert Landley (but subsequently dropped a while later) that is a capable, fast C90/C99 compiler.

      His projects page (http://bellard.org/) and the older projects (http://bellard.org/projects.html) contain a lot of interesting projects.

      Also of note: Fabrice achieved the record for Pi computation in 1997 as well:
            http://bellard.org/pi/pi_hexa.html
            http://bellard.org/pi-challenge/announce220997.html
            http://bellard.org/pi/

  4. Re:Thats nice and all... by LostCluster · · Score: 5, Funny

    Only if you avoid the square routes.

  5. He needs some help... by LostCluster · · Score: 5, Funny

    1 TB data files... somebody needs to help him with the compression! Oh, wait a minute.

  6. Re:silly by Trepidity · · Score: 5, Informative

    As he points out himself, he doesn't really care about calculating digits of Pi; it's a convenient hook on which to hang an interesting algorithms challenge. From the FAQ:

    I am not especially interested in the digits of Pi, but in the various algorithms involved to do arbitrary-precision arithmetic. Optimizing these algorithms to get good performance is a difficult programming challenge.

    He also mentions elsewhere that of his code, "The most important part is an arbitrary-precision arithmetic library able to manipulate huge numbers stored on hard disks."

  7. Too bad... by hallux.sinister · · Score: 5, Funny
    Only another four hundred billion decimal places, and they would have found the last one!

    ~Hal