2 ms·
Probably more than likely it's not generalizable to real world conditions. Benchmarks are meant to be reproducible, meaning perfectly predictable. CPUs have t
by Infinity315 4y ago
Probably more than likely it's not generalizable to real world conditions.
Benchmarks are meant to be reproducible, meaning perfectly predictable. CPUs have things called branch predictors which try to predict what the software is going to do and try to do the calculation ahead of time resulting in (hopefully, if it predicted right) faster execution time. If you know which 'branches' a benchmark goes down, you can make a program which can coax the branch predictor to always make the right guesses for a given benchmark.
A program branches whenever you encounter some sort of conditional if-else statement.