fibonacci_recursive/our/16
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.7907 µs | 1.7924 µs | 1.7946 µs |
| Throughput | 8.9154 Melem/s | 8.9264 Melem/s | 8.9351 Melem/s |
| R² | 0.9942527 | 0.9943829 | 0.9941785 |
| Mean | 1.7903 µs | 1.7927 µs | 1.7962 µs |
| Std. Dev. | 5.8840 ns | 15.660 ns | 25.351 ns |
| Median | 1.7894 µs | 1.7906 µs | 1.7919 µs |
| MAD | 4.4470 ns | 6.4817 ns | 7.6251 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.