fibonacci_recursive/our/16
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.7918 µs | 1.7940 µs | 1.7969 µs |
| Throughput | 8.9043 Melem/s | 8.9184 Melem/s | 8.9298 Melem/s |
| R² | 0.9935565 | 0.9937821 | 0.9934365 |
| Mean | 1.7918 µs | 1.7942 µs | 1.7971 µs |
| Std. Dev. | 7.9423 ns | 13.654 ns | 19.857 ns |
| Median | 1.7898 µs | 1.7909 µs | 1.7931 µs |
| MAD | 5.5299 ns | 7.8317 ns | 10.279 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.