fibonacci_recursive/our/8
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.3851 µs | 1.3877 µs | 1.3917 µs |
| Throughput | 5.7483 Melem/s | 5.7651 Melem/s | 5.7760 Melem/s |
| R² | 0.9895476 | 0.9900226 | 0.9888703 |
| Mean | 1.3877 µs | 1.3941 µs | 1.4028 µs |
| Std. Dev. | 10.551 ns | 39.620 ns | 61.539 ns |
| Median | 1.3847 µs | 1.3858 µs | 1.3868 µs |
| MAD | 3.6963 ns | 5.0421 ns | 6.3300 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.