fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 4.2863 µs | 4.3037 µs | 4.3268 µs |
| Throughput | 7.3958 Melem/s | 7.4354 Melem/s | 7.4657 Melem/s |
| R² | 0.9616000 | 0.9637311 | 0.9600179 |
| Mean | 4.2851 µs | 4.2940 µs | 4.3052 µs |
| Std. Dev. | 21.750 ns | 52.127 ns | 76.004 ns |
| Median | 4.2785 µs | 4.2827 µs | 4.2860 µs |
| MAD | 11.672 ns | 15.389 ns | 19.328 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.