Fabrice Bellard
| Fabrice Bellard | |
|---|---|
| Born | 1972 Grenoble, France |
| Known for | QEMU, FFmpeg, Tiny C Compiler, Bellard's formula |
| Website | |
| bellard.org | |
 |
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (January 2010) |
Fabrice Bellard (French pronunciation: [fabʁis bɛlaʁ]) is a computer programmer who is best known as the creator of the FFmpeg and QEMU software projects. He has also developed a number of other programs, including the Tiny C Compiler.
He was born in 1972 in Grenoble, France and went to school in Lycée Joffre (Montpellier), where he created the famous[1] executable compressor LZEXE. After studying at l'École Polytechnique, he went on to specialize at Télécom Paris in 1996.
Fabrice Bellard's entries won the International Obfuscated C Code Contest twice[2]: In 2000, he won in the category "Most Specific Output"[3] for a program that implemented the modular Fast Fourier Transform and used it to compute the then biggest known prime number, 2^6972593-1[4]; and in 2001, he won in the category "Best Abuse of the Rules" for a tiny compiler (the source code being only 3KB in size) of a strict subset of the C language for i386 Linux. The program itself is written in this language subset.
He has since continued his work writing software. In 2004, he wrote the TinyCC Boot Loader, which can compile and boot a Linux kernel from source in less than 15 seconds.[5] In 2005, he designed a system that could act as an Analog or DVB-T Digital TV transmitter by directly generating a VHF signal from a standard PC and VGA card.[6] In 2011, he created a minimal PC emulator written in pure JavaScript. The emulated hardware consists of a 32-bit x86 compatible CPU, a 8259 Programmable Interrupt Controller, a 8254 Programmable Interrupt Timer, and a 16450 UART.[7]
In 2011 he won a Google-O'Reilly Open Source Award[8].
Contents |
[edit] Pi calculation record
In 1997, he discovered a new, faster formula to calculate single digits of pi in binary representation, known as Bellard's formula. It is a variant of the Bailey-Borwein-Plouffe formula.[9]
On December 31st, 2009, he claimed the world record for calculations of π, having calculated it to nearly 2.7 trillion places in 90 days. Slashdot wrote: "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."[10][11] On Aug 2, 2010, this record was eclipsed by Shigeru Kondo who computed 5 trillion digits, although this was done using a server-class machine running dual Intel Xeons, equipped with 96GB of RAM.
[edit] See also
[edit] Notes
- ^ LZEXE project page
- ^ International Obfuscated C Code Contest years page
- ^ http://www0.us.ioccc.org/years.html#2000
- ^ http://www0.us.ioccc.org/2000/bellard.hint
- ^ "TCCBOOT Compiles And Boots Linux In 15 Seconds". Slashdot. 2004-10-25. http://news.slashdot.org/story/04/10/25/2245259/TCCBOOT-Compiles-And-Boots-Linux-In-15-Seconds.
- ^ "Digital TV Transmitter using a VGA card". Slashdot. 2005-06-13. http://hardware.slashdot.org/story/05/06/13/1946240/Digital-TV-Transmitter-Using-a-VGA-card.
- ^ "Javascript PC Emulator - Technical Notes". Fabrice Bellard. 2011-05-14. http://bellard.org/jslinux/tech.html.
- ^ "OSCON 2011: O'Reilly Open Source Awards". http://www.oscon.com/oscon2011/public/schedule/detail/21161. Retrieved 2011-09-17.
- ^ A new formula to compute the n'th binary digit of pi January 21, 1997
- ^ New Pi Computation Record Using a Desktop PC January 5, 2010
- ^ Jason Palmer (2010-01-06). "Pi calculated to 'record number' of digits". BBC News. http://news.bbc.co.uk/1/hi/technology/8442255.stm.
[edit] External links
 |
This biographical article relating to a computer specialist is a stub. You can help Wikipedia by expanding it. |
