fibonacci_recursive/our/512
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 57.318 µs | 57.434 µs | 57.589 µs |
| Throughput | 8.8905 Melem/s | 8.9145 Melem/s | 8.9327 Melem/s |
| R² | 0.9899635 | 0.9905376 | 0.9895284 |
| Mean | 57.284 µs | 57.422 µs | 57.627 µs |
| Std. Dev. | 270.78 ns | 911.87 ns | 1.4795 µs |
| Median | 57.185 µs | 57.227 µs | 57.256 µs |
| MAD | 92.501 ns | 133.88 ns | 186.68 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.