- Fulfilling a Pikedream: the ups of downs of porting 50k lines of C++ to Go.
- Fibonacci numbers on the Galaxy S3: ARM benchmarks of Rust, Ocaml, Haskell, Go, Racket, Lua, C# and Java
- Why Go is Great (for servers)
- The Magic Forest problem revisited: rehabilitating Java with the aid of D.
- Memory Access Microbenchmark: Clojure, F#, Go, Julia, Lua, Racket, Ruby, Self…
bob on Fibonacci numbers on the Galax… kimberly on “I’m from Microsof… logicchains on Fulfilling a Pikedream: the up… logicchains on Fulfilling a Pikedream: the up… logicchains on Fulfilling a Pikedream: the up…
Tag Archives: Java
Fibonacci numbers on the Galaxy S3: ARM benchmarks of Rust, Ocaml, Haskell, Go, Racket, Lua, C# and Java
I recently upgraded my phone to a Galaxy S3, an ARMv7 device with 2GB of ram and a quad-core 1.3ghz processor. After installing Arch Linux on it (only in a chroot; I’m not brave enough to boot directly into it), … Continue reading
I recently came across an interesting blog post in which Java performed slower than I’d have thought reasonable, around 4 times slower than C++, so I decided to try my luck at making it faster. The problem? Imagine a forest … Continue reading
*Edit – For clarity, I’ve decided to just include the most up-to-date, fair and relevant results tables at the top here. Scroll down below to read more about the optimisation process and the effectiveness of various different implementations. NumTrades = … Continue reading