fibonacci_recursive/our/16
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 2.1690 µs | 2.1720 µs | 2.1771 µs |
| Throughput | 7.3491 Melem/s | 7.3664 Melem/s | 7.3766 Melem/s |
| R² | 0.9914520 | 0.9917150 | 0.9909545 |
| Mean | 2.1686 µs | 2.1709 µs | 2.1740 µs |
| Std. Dev. | 5.1096 ns | 14.188 ns | 22.480 ns |
| Median | 2.1672 µs | 2.1681 µs | 2.1692 µs |
| MAD | 2.9174 ns | 4.2471 ns | 5.4157 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.