fibonacci_recursive/our/128
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 13.174 µs | 13.196 µs | 13.232 µs |
| Throughput | 9.6734 Melem/s | 9.6997 Melem/s | 9.7162 Melem/s |
| R² | 0.9911994 | 0.9915910 | 0.9905791 |
| Mean | 13.179 µs | 13.194 µs | 13.212 µs |
| Std. Dev. | 49.244 ns | 85.072 ns | 121.44 ns |
| Median | 13.162 µs | 13.169 µs | 13.178 µs |
| MAD | 21.605 ns | 32.460 ns | 39.539 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.