fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 3.4178 µs | 3.4231 µs | 3.4299 µs |
| Throughput | 9.3298 Melem/s | 9.3482 Melem/s | 9.3628 Melem/s |
| R² | 0.9937546 | 0.9940902 | 0.9935519 |
| Mean | 3.4205 µs | 3.4241 µs | 3.4281 µs |
| Std. Dev. | 13.363 ns | 19.301 ns | 26.163 ns |
| Median | 3.4180 µs | 3.4231 µs | 3.4268 µs |
| MAD | 12.222 ns | 14.776 ns | 18.342 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.