fibonacci_recursive/our/512
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 57.305 µs | 57.372 µs | 57.473 µs |
| Throughput | 8.9085 Melem/s | 8.9242 Melem/s | 8.9346 Melem/s |
| R² | 0.9936112 | 0.9937984 | 0.9933727 |
| Mean | 57.302 µs | 57.365 µs | 57.448 µs |
| Std. Dev. | 161.26 ns | 379.00 ns | 585.59 ns |
| Median | 57.259 µs | 57.275 µs | 57.288 µs |
| MAD | 51.909 ns | 71.096 ns | 99.096 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.