fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 6.7054 µs | 6.7159 µs | 6.7319 µs |
| Throughput | 9.5070 Melem/s | 9.5296 Melem/s | 9.5446 Melem/s |
| R² | 0.9922834 | 0.9926201 | 0.9918492 |
| Mean | 6.7051 µs | 6.7124 µs | 6.7213 µs |
| Std. Dev. | 22.379 ns | 41.616 ns | 60.316 ns |
| Median | 6.6978 µs | 6.7025 µs | 6.7092 µs |
| MAD | 12.587 ns | 16.564 ns | 20.876 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.