fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 10.697 µs | 10.701 µs | 10.705 µs |
| Throughput | 5.9783 Melem/s | 5.9805 Melem/s | 5.9828 Melem/s |
| R² | 0.9995938 | 0.9996133 | 0.9995938 |
| Mean | 10.693 µs | 10.700 µs | 10.708 µs |
| Std. Dev. | 19.817 ns | 37.550 ns | 55.995 ns |
| Median | 10.690 µs | 10.696 µs | 10.700 µs |
| MAD | 13.389 ns | 18.233 ns | 22.249 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.