fibonacci_recursive/our/512
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 65.991 µs | 66.102 µs | 66.278 µs |
| Throughput | 7.7251 Melem/s | 7.7456 Melem/s | 7.7586 Melem/s |
| R² | 0.9860743 | 0.9864556 | 0.9854919 |
| Mean | 66.119 µs | 66.294 µs | 66.506 µs |
| Std. Dev. | 489.78 ns | 1.0011 µs | 1.4001 µs |
| Median | 65.953 µs | 66.004 µs | 66.039 µs |
| MAD | 117.85 ns | 173.77 ns | 223.23 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.