fibonacci_recursive/our/512
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 50.139 µs | 50.193 µs | 50.269 µs |
| Throughput | 10.185 Melem/s | 10.201 Melem/s | 10.212 Melem/s |
| R² | 0.9944716 | 0.9946351 | 0.9943228 |
| Mean | 50.148 µs | 50.203 µs | 50.277 µs |
| Std. Dev. | 157.17 ns | 335.30 ns | 518.23 ns |
| Median | 50.089 µs | 50.133 µs | 50.169 µs |
| MAD | 89.538 ns | 132.89 ns | 174.14 ns |
Understanding this report:
The plot on the left displays the average time per iteration for this benchmark. The shaded region shows the estimated probability of an iteration taking a certain amount of time, while the line shows the mean. Click on the plot for a larger view showing the outliers.
The plot on the right shows the linear regression calculated from the measurements. Each point represents a sample, though here it shows the total time for the sample rather than time per iteration. The line is the line of best fit for these measurements.
See the documentation for more details on the additional statistics.