fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 5.0317 µs | 5.0407 µs | 5.0526 µs |
| Throughput | 6.3333 Melem/s | 6.3484 Melem/s | 6.3597 Melem/s |
| R² | 0.9872456 | 0.9876821 | 0.9869135 |
| Mean | 5.0311 µs | 5.0393 µs | 5.0509 µs |
| Std. Dev. | 17.306 ns | 51.793 ns | 82.253 ns |
| Median | 5.0262 µs | 5.0282 µs | 5.0314 µs |
| MAD | 7.0053 ns | 9.1542 ns | 11.448 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.