fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 26.148 µs | 26.169 µs | 26.197 µs |
| Throughput | 9.7721 Melem/s | 9.7825 Melem/s | 9.7905 Melem/s |
| R² | 0.9925369 | 0.9926287 | 0.9924738 |
| Mean | 26.150 µs | 26.227 µs | 26.340 µs |
| Std. Dev. | 71.731 ns | 502.18 ns | 796.46 ns |
| Median | 26.130 µs | 26.139 µs | 26.151 µs |
| MAD | 29.255 ns | 41.654 ns | 52.994 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.