-
-
Notifications
You must be signed in to change notification settings - Fork 5.6k
fix microbenchmarks to be more alike #13729
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Comments
I think this is perf related? Could we get, like, a paragraph summary of what the situation is? |
The issue is that the original benchmark is supposed to use 2d indexing in construction of the complex array in mandel. Many of the versions are hand-linearized (C, Java, Fortran, Lua, Go, etc.). The other issue is that some of the benchmarks are not even creating the array and just summing up values upon computation. The summing is a correctness check, but the benchmark is to compute the complex array. I notice this in at least the Java and Fortran versions. |
You could change the correctness check to access the array elements in an "unpredictable" order (and accessing some array elements twice, maybe not accessing all of them). This should prevent that optimization. |
Moved to JuliaLang/Microbenchmarks#23 |
See: #13673
The text was updated successfully, but these errors were encountered: