fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 37.347 µs | 37.446 µs | 37.570 µs |
| Throughput | 6.8139 Melem/s | 6.8365 Melem/s | 6.8546 Melem/s |
| R² | 0.9747792 | 0.9757135 | 0.9742448 |
| Mean | 37.344 µs | 37.429 µs | 37.534 µs |
| Std. Dev. | 252.15 ns | 489.99 ns | 670.68 ns |
| Median | 37.258 µs | 37.267 µs | 37.296 µs |
| MAD | 42.409 ns | 57.339 ns | 95.274 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.