fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 25.262 µs | 25.292 µs | 25.334 µs |
| Throughput | 10.105 Melem/s | 10.122 Melem/s | 10.134 Melem/s |
| R² | 0.9955524 | 0.9957413 | 0.9953632 |
| Mean | 25.265 µs | 25.292 µs | 25.324 µs |
| Std. Dev. | 85.791 ns | 151.89 ns | 209.38 ns |
| Median | 25.244 µs | 25.258 µs | 25.280 µs |
| MAD | 49.743 ns | 69.513 ns | 83.774 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.