search for: 40uni

On Tue, 5 Oct 2004, Alex Vinokur wrote: > I would like to use LLVM-GCC to compare its performance with other compilers. > Something like testsuite "Computing very large Fibonacci numbers" at > http://article.gmane.org/gmane.comp.lang.c%2B%2B.perfometer/37. Out of curiousity, I ran some quick tests on a AMD Athlon(TM) MP 2100+ box running Redhat linux 7.1. With the LLVM C

...m was to create fast _recursive_ algorithm. The algorithm generates very large Fibonacci numbers using the primary recursive formula: F(n) = F(n-1) + F(n-2) n > 1; F(1) = 1, F(0) = 0. Latest version of the algorithm is 2.7.9 and can be seen at http://groups.google.com/groups?selm=2paj5hFim4q1U1%40uni-berlin.de > so it's not a wonderful benchmark of CPU bound tasks (also, the compiler in use will > have less impact than for a CPU bound program). In any case, I've added > this program to the LLVM testsuite as > SingleSource/Benchmarks/Misc-C++/bigfib.cpp, so we should have n...

Hi, I would like to use LLVM-GCC to compare its performance with other compilers. Something like testsuite "Computing very large Fibonacci numbers" at http://article.gmane.org/gmane.comp.lang.c%2B%2B.perfometer/37. My environment: ----------------- Windows 2000 Cygwin $ uname -srom CYGWIN_NT-5.0 1.5.11(0.116/4/2) i686 Cygwin ----------------- What do I have to download from