fibonacci_recursive/our/128
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 20.866 µs | 20.880 µs | 20.903 µs |
| Throughput | 6.1236 Melem/s | 6.1301 Melem/s | 6.1342 Melem/s |
| R² | 0.9976205 | 0.9976824 | 0.9975238 |
| Mean | 20.871 µs | 20.888 µs | 20.911 µs |
| Std. Dev. | 40.807 ns | 103.70 ns | 155.43 ns |
| Median | 20.861 µs | 20.864 µs | 20.873 µs |
| MAD | 23.139 ns | 28.303 ns | 44.885 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.