fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 2.7313 µs | 2.7344 µs | 2.7386 µs |
| Throughput | 11.685 Melem/s | 11.703 Melem/s | 11.716 Melem/s |
| R² | 0.9960476 | 0.9962224 | 0.9958953 |
| Mean | 2.7336 µs | 2.7367 µs | 2.7403 µs |
| Std. Dev. | 10.140 ns | 17.137 ns | 23.419 ns |
| Median | 2.7323 µs | 2.7337 µs | 2.7353 µs |
| MAD | 5.5126 ns | 7.6483 ns | 9.6432 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.