http://blog.golang.org/4years - From Nov 2013
No, the Go optimizing isn't great. This will be addressed after the compiler is completely rewritten from C to Go. The Go community is growing too, which is probably more important than how well you do on a micro benchmark.
http://talks.golang.org/2014/c2go.slide#18
And, the gccgo compiler does leverage gcc, assuming that counts as a mature compiler:
http://blog.golang.org/gccgo-in-gcc-471
. Neither of these contradict your implicit point of "they chose to invest time in this port instead of trying to maximize performance ASAP", but you still might want to know.
It seems you'd lose out on picking up improvements from the main compiler branch and have to keep transpiling and gardening in patches. Plus upstreaming improvements would also be irritating.
I'd think a Go frontend to LLVM would be optimal in terms of productivity.
https://blog.golang.org/gccgo-in-gcc-471
The Go developers have claimed LLVM was not useful because it's too slow, which is why they used the plan9 compiler style.
Here's java compared to go on all benchmarks, 64-bit:
quad-core:
http://benchmarksgame.alioth.debian.org/u64q/benchmark.php?t...
single-core:
http://benchmarksgame.alioth.debian.org/u64/benchmark.php?te...
Gives a much better overview than a single test running under 32-bit .
I thought that single vs multi-core was comparable on either 32 or 64 bit.
Otherwise, I thought I was pretty clear why I picked binary tree over, say, mandelbrot set. Wanted to favor "data structure" usage over number crunching.
More addressable memory is but one advantage of 64-bit versus 32-bit, the fact that it has double the amount of registers is another VERY important performance aspect since registers are by far the fastest place to store and retrieve data from, so less need to push values from registers on to stack / flushing cache lines, means faster running code, and in hot loops the difference in performance can be huge.
>Otherwise, I thought I was pretty clear why I picked binary tree over, say, mandelbrot set.
But why not show ALL the results and just highlight binary trees, there are a lot more benchmarks there than mandelbrot, also I don't see what is wrong with 'number crunching' benchmarks ?
Most business apps don't do much number crunching or bit-twiddling. Think of moving strings/records/objects to and from a data store, putting them temporarily in an in-memory hierarchy or an indexed cache for lookup/evaluation, then pumping more strings to a browser / the console / a dialog box.
I didn't pick the binary tree example to pick on Go, it's my "best match use case" for the "allocate and find things" that I envision goes on in most applications, regardless of which languages I am comparing.
I love the concept of rust, but trying to write a trivial program in it was a pain in the ass.
The reason things have been changing so much is mainly to get a better language now, and not have to write a 2.0 that changes everything. When you look at rust code from six months ago, things have improved greatly, so it will hopefully be worth it.
Go isn't yet faster than Java, but it is closing the gap, at least on multi-core: http://benchmarksgame.alioth.debian.org/u32q/benchmark.php?t...
Single core doesn't fare so well (Go vs Java), though: http://benchmarksgame.alioth.debian.org/u32/benchmark.php?te...
Perhaps the authors should have used Rust, or Ada, rather than Go? Hell, on a single CPU machine, FreePascal seems to do better than Go :-)
Actually, from a "performance, w/out turning off all the safeties" standpoint, it really looks like Rust is owning that space.
Now I gotta learn Rust... :-)