fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 5.4805 µs | 5.4888 µs | 5.5005 µs |
| Throughput | 5.8176 Melem/s | 5.8300 Melem/s | 5.8389 Melem/s |
| R² | 0.9644226 | 0.9647248 | 0.9641364 |
| Mean | 5.4809 µs | 5.5062 µs | 5.5467 µs |
| Std. Dev. | 19.887 ns | 176.43 ns | 291.36 ns |
| Median | 5.4740 µs | 5.4784 µs | 5.4811 µs |
| MAD | 9.5241 ns | 12.844 ns | 16.193 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.