fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 33.546 µs | 33.580 µs | 33.630 µs |
| Throughput | 7.6122 Melem/s | 7.6235 Melem/s | 7.6313 Melem/s |
| R² | 0.9909093 | 0.9910493 | 0.9907502 |
| Mean | 33.571 µs | 33.671 µs | 33.798 µs |
| Std. Dev. | 146.94 ns | 585.63 ns | 856.94 ns |
| Median | 33.530 µs | 33.537 µs | 33.555 µs |
| MAD | 42.904 ns | 61.181 ns | 88.925 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.