fibonacci_recursive/our/128
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 19.361 µs | 19.404 µs | 19.483 µs |
| Throughput | 6.5699 Melem/s | 6.5964 Melem/s | 6.6111 Melem/s |
| R² | 0.9808898 | 0.9815415 | 0.9793686 |
| Mean | 19.386 µs | 19.758 µs | 20.233 µs |
| Std. Dev. | 147.07 ns | 2.1589 µs | 3.1981 µs |
| Median | 19.345 µs | 19.356 µs | 19.370 µs |
| MAD | 28.018 ns | 39.453 ns | 52.108 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.