fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 7.7332 µs | 7.7411 µs | 7.7516 µs |
| Throughput | 8.2563 Melem/s | 8.2676 Melem/s | 8.2760 Melem/s |
| R² | 0.9919229 | 0.9920650 | 0.9918096 |
| Mean | 7.7371 µs | 7.7501 µs | 7.7705 µs |
| Std. Dev. | 25.385 ns | 89.034 ns | 146.79 ns |
| Median | 7.7320 µs | 7.7340 µs | 7.7394 µs |
| MAD | 13.058 ns | 17.543 ns | 25.709 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.