fibonacci_recursive/our/128
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 17.308 µs | 17.357 µs | 17.429 µs |
| Throughput | 7.3443 Melem/s | 7.3745 Melem/s | 7.3954 Melem/s |
| R² | 0.9709779 | 0.9720356 | 0.9697971 |
| Mean | 17.305 µs | 17.350 µs | 17.409 µs |
| Std. Dev. | 40.328 ns | 272.26 ns | 416.84 ns |
| Median | 17.295 µs | 17.300 µs | 17.307 µs |
| MAD | 19.390 ns | 26.775 ns | 36.395 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.