fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 4.3839 µs | 4.3959 µs | 4.4115 µs |
| Throughput | 7.2538 Melem/s | 7.2795 Melem/s | 7.2994 Melem/s |
| R² | 0.9864856 | 0.9873538 | 0.9858893 |
| Mean | 4.3839 µs | 4.3899 µs | 4.3972 µs |
| Std. Dev. | 18.045 ns | 34.170 ns | 47.890 ns |
| Median | 4.3805 µs | 4.3824 µs | 4.3855 µs |
| MAD | 7.4037 ns | 10.180 ns | 14.280 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.