fibonacci_recursive/our/128
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 12.654 µs | 12.715 µs | 12.810 µs |
| Throughput | 9.9923 Melem/s | 10.067 Melem/s | 10.115 Melem/s |
| R² | 0.9313163 | 0.9341281 | 0.9272702 |
| Mean | 12.651 µs | 12.684 µs | 12.732 µs |
| Std. Dev. | 45.675 ns | 210.77 ns | 337.56 ns |
| Median | 12.644 µs | 12.652 µs | 12.662 µs |
| MAD | 30.321 ns | 38.645 ns | 44.872 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.