I have two benchmarks:
On an: Intel(R) Core(TM)2 CPU T7200 @ 2.00GHz stepping 06
g++ --version
g++ (GCC) 4.1.2 20070925 (Red Hat 4.1.2-33)
I had to modify SConstruct to refer to the default g++, not g++.4.2
and had to remove -march=native
= Benchmarking, please wait ...
= 20
Just to add my 2c for the performance freaks. I've noticed that code
generated by g++ 4.3.x was about 40-45% faster non-optimized when
compared to previous versions of g++ (native linux platform). When
optimizing code (-O3), 4.3 generated code that was 20% faster. This is
probably the more
I read that story in a book, just after Bobby Fisher's death. Don't
remember all details, save that he was astonished he got beaten.
Adrian
Don Dailey wrote:
Does anyone remember an anecdote about Bobby Fischer learning to play
go? I don't remember the details but I'm trying to find a
Linux is a time sinkhole to someone not familiar with it.You are
probably almost unaware of the huge investment in time you spent
learning windows because the lessons happened gradually over many years
and you don't give it a second thought. You just know it and forgot
that you had to
By the way, does anybody know of any nifty tools or heuristics for
efficient probabilistic multi-parameter optimization? In other words,
like multi-dimensional optimization, except instead of your function
returning a deterministic value, it returns the result of a Bernoulli
trial, and the
Nick, do you know for a fact that a C++ complier will optimize for the
base case of a virtual function? I was under the impression that it
doesn't know (as in can't determine at compile time) whether the
function was overwritten or not so it doesn't favor any of the cases. In
fact I can't even
