Note: The much faster version Go's DNA regex that uses PCRE rather than "regexp", but it is currently broken due to a build error. (http://benchmarksgame.alioth.debian.org/u64/program.php?test...)
Go uses less memory than Java 7, but then again so does Java 1.1
http://benchmarksgame.alioth.debian.org/u64q/benchmark.php?t...
That said, Java still beats Go quite readily in this benchmark spread, particularly in regex and binary-trees where Go does extremely poor. It should be noted that lots of languages implement their regex libraries in C for speed, while Go's implementation is written in Go. Still, I think it should do better than this.
That Java beats Go overall is not particularly surprising, Java is very mature and it's jit-compiler has very advanced optimizations, Perhaps by Go 2.0 we'll see where Go 'lands' in terms of performance, there's obviously alot more to be had.
http://benchmarksgame.alioth.debian.org/u32q/benchmark.php?t...
http://benchmarksgame.alioth.debian.org/u32q/program.php?tes...
Note that:
1) It only ever uses one core, because
2) It isn't configured with GOMAXPROCS, which therefore defaults to 1.
So, sure, they have an N-core machine, but they're only allowing go to access 1 core.
Notice on the list provided by `trailfox` the "≈ CPU Load" column -- when the programs are written to use 4 cores "they're" allowing Go to access 4 cores.
The go program in question was written without that instruction; therefore, it's only allowed to use one core.
Only "allowed" by who?
If you mean that "the Go program in question" is by-design a sequential program then -- yes of course it is!
The contributed Go programs that were written for multi-core use more than one core -- http://benchmarksgame.alioth.debian.org/u32q/program.php?tes...