fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 6.4596 µs | 6.4703 µs | 6.4836 µs |
| Throughput | 9.8711 Melem/s | 9.8914 Melem/s | 9.9077 Melem/s |
| R² | 0.9932909 | 0.9936691 | 0.9930848 |
| Mean | 6.4586 µs | 6.4658 µs | 6.4740 µs |
| Std. Dev. | 24.514 ns | 39.417 ns | 53.699 ns |
| Median | 6.4529 µs | 6.4565 µs | 6.4605 µs |
| MAD | 12.003 ns | 16.030 ns | 22.270 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.