fibonacci_recursive/our/8
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.0347 µs | 1.0363 µs | 1.0384 µs |
| Throughput | 7.7044 Melem/s | 7.7201 Melem/s | 7.7317 Melem/s |
| R² | 0.9936711 | 0.9939830 | 0.9934091 |
| Mean | 1.0354 µs | 1.0387 µs | 1.0433 µs |
| Std. Dev. | 4.4359 ns | 20.689 ns | 31.937 ns |
| Median | 1.0339 µs | 1.0349 µs | 1.0361 µs |
| MAD | 3.1635 ns | 4.1871 ns | 5.0560 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.