Stefan Marr

Possibly relevant to consider #21.

Also useful: try to parse output already while it is running, to persist data, empty output buffers, and possibly indicate progress more fine-grained, i.e., on iteration level, not just invocation...

This is related to #132 and should be considered with it.

Very interesting. Thanks! I think, Rust is going to be a challenge. So far, we have only have support for languages with garbage collection, i.e., automated memory management. While I...

I think, we will need to work through each benchmark and see what makes sense. Something like NBody, with a fixed set of bodies seems different than for instance the...

@OvermindDL1 thanks for putting all the effort into this. Please don't consider my silence and absence of interest. It's just end of term time here. So, pretty busy time of...

> it's broken enough that if it were used for anything more than the simple benchmark then it wouldn't really work as it is. Anything specific that might be worth...

This is with get.pharo.org/vm50 ``` pharo AWFY.image run.st CD 100 100 Starting CD benchmark ... CD: iterations=1 runtime: 4165824110us CD: iterations=1 runtime: 3696891449us ```

There is a Scala port available here: https://github.com/scala-native/scala-native/tree/master/benchmarks/src/main/scala via: https://twitter.com/den_sh/status/814421338366636032

Thanks @vchuravy, Julia would be a very interesting addition. Please note the reasoning and rules behind these benchmarks: - https://stefan-marr.de/papers/dls-marr-et-al-cross-language-compiler-benchmarking-are-we-fast-yet/ - https://github.com/smarr/are-we-fast-yet/blob/master/docs/guidelines.md - https://github.com/smarr/are-we-fast-yet/blob/master/docs/core-language.md They may or may not fit...