fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 5.0327 µs | 5.0378 µs | 5.0450 µs |
| Throughput | 12.686 Melem/s | 12.704 Melem/s | 12.717 Melem/s |
| R² | 0.9958400 | 0.9959815 | 0.9956977 |
| Mean | 5.0344 µs | 5.0452 µs | 5.0601 µs |
| Std. Dev. | 19.015 ns | 66.636 ns | 105.27 ns |
| Median | 5.0306 µs | 5.0337 µs | 5.0359 µs |
| MAD | 9.9198 ns | 13.476 ns | 16.428 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.