fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 3.6693 µs | 3.6733 µs | 3.6795 µs |
| Throughput | 8.6968 Melem/s | 8.7116 Melem/s | 8.7210 Melem/s |
| R² | 0.9950224 | 0.9951820 | 0.9947861 |
| Mean | 3.6699 µs | 3.6765 µs | 3.6867 µs |
| Std. Dev. | 8.6205 ns | 44.530 ns | 73.178 ns |
| Median | 3.6674 µs | 3.6687 µs | 3.6700 µs |
| MAD | 4.1400 ns | 5.7196 ns | 7.3875 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.