HACKER Q&A
📣 xqb64

How do you benchmark your programming languages?


During the development of my tiny (less than 4k LoC) virtual machine, I continuously measured how long it took to execute recursive fibonacci function (fib(40)) as a way to estimate how performant it is.

What other benchmarks do you use for your programming languages?

  👤 npalli Accepted Answer ✓
If you are using fibonacci to test out performance in the small, you might want to stick with the Computer Language Benchmark Game. It gives you the universe of languages and sample programs to you can see what works best with your VM.

https://benchmarksgame-team.pages.debian.net/benchmarksgame/...

👤 DemocracyFTW2
Using a single function, and then recursive Fibonacci of all, is certainly not enough to give estimates about The Language. Everyone should know that although recursive Fibonacci is like that one poster function that comes right after Hello World it is not a recommended implementation strategy for that functionality in most languages (but of course if you can make it run as fast as the linearized version that would be a good thing).

I haven't implemented any language / VM of my own, but when I write a library then even for very specialized purposes I often write several tests when I want to be on the safe side as far as performance goes (correctness being the more important concern most of the time). Also, I typically want to have tests involving other libraries (or other VMs in your case) to get an idea of how fast I am in comparison, otherwise I'd be stuck with oh wow 1000 times doing something takes just under a moment kind of wisdom.