fibonacci_recursive/our/16
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 2.5299 µs | 2.5359 µs | 2.5442 µs |
| Throughput | 6.2887 Melem/s | 6.3093 Melem/s | 6.3244 Melem/s |
| R² | 0.9815684 | 0.9823396 | 0.9808888 |
| Mean | 2.5292 µs | 2.5336 µs | 2.5393 µs |
| Std. Dev. | 8.5651 ns | 26.057 ns | 37.342 ns |
| Median | 2.5267 µs | 2.5282 µs | 2.5304 µs |
| MAD | 5.4562 ns | 7.2695 ns | 9.8983 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.