fibonacci_recursive/our/16
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.7770 µs | 1.7799 µs | 1.7838 µs |
| Throughput | 8.9697 Melem/s | 8.9893 Melem/s | 9.0040 Melem/s |
| R² | 0.9939012 | 0.9942712 | 0.9936095 |
| Mean | 1.7793 µs | 1.7823 µs | 1.7860 µs |
| Std. Dev. | 9.3048 ns | 17.082 ns | 24.955 ns |
| Median | 1.7781 µs | 1.7794 µs | 1.7821 µs |
| MAD | 6.2509 ns | 7.5033 ns | 10.361 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.