fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 8.6034 µs | 8.6146 µs | 8.6325 µs |
| Throughput | 7.4138 Melem/s | 7.4292 Melem/s | 7.4389 Melem/s |
| R² | 0.9908746 | 0.9911015 | 0.9905166 |
| Mean | 8.6057 µs | 8.6179 µs | 8.6349 µs |
| Std. Dev. | 20.057 ns | 76.469 ns | 120.89 ns |
| Median | 8.5992 µs | 8.6030 µs | 8.6063 µs |
| MAD | 10.580 ns | 13.525 ns | 18.829 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.