fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 2.6130 µs | 2.6193 µs | 2.6280 µs |
| Throughput | 12.177 Melem/s | 12.217 Melem/s | 12.246 Melem/s |
| R² | 0.9829718 | 0.9837467 | 0.9822737 |
| Mean | 2.6150 µs | 2.6218 µs | 2.6315 µs |
| Std. Dev. | 10.757 ns | 43.278 ns | 69.229 ns |
| Median | 2.6122 µs | 2.6142 µs | 2.6160 µs |
| MAD | 5.7680 ns | 8.2425 ns | 10.571 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.