fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 6.4931 µs | 6.4991 µs | 6.5057 µs |
| Throughput | 9.8375 Melem/s | 9.8476 Melem/s | 9.8567 Melem/s |
| R² | 0.9929208 | 0.9930367 | 0.9928935 |
| Mean | 6.4888 µs | 6.5040 µs | 6.5296 µs |
| Std. Dev. | 22.021 ns | 111.71 ns | 187.29 ns |
| Median | 6.4846 µs | 6.4903 µs | 6.4978 µs |
| MAD | 16.716 ns | 23.192 ns | 28.364 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.