fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 3.4373 µs | 3.4456 µs | 3.4565 µs |
| Throughput | 9.2580 Melem/s | 9.2873 Melem/s | 9.3097 Melem/s |
| R² | 0.9836988 | 0.9844690 | 0.9831341 |
| Mean | 3.4357 µs | 3.4415 µs | 3.4483 µs |
| Std. Dev. | 18.266 ns | 32.437 ns | 44.235 ns |
| Median | 3.4369 µs | 3.4404 µs | 3.4428 µs |
| MAD | 9.8670 ns | 13.161 ns | 16.953 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.