fibonacci_recursive/our/512
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 38.950 µs | 38.983 µs | 39.031 µs |
| Throughput | 13.118 Melem/s | 13.134 Melem/s | 13.145 Melem/s |
| R² | 0.9966163 | 0.9967149 | 0.9965090 |
| Mean | 38.945 µs | 38.975 µs | 39.018 µs |
| Std. Dev. | 76.921 ns | 191.39 ns | 306.98 ns |
| Median | 38.927 µs | 38.938 µs | 38.960 µs |
| MAD | 59.263 ns | 82.277 ns | 103.83 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.