fibonacci_recursive/our/16
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.8547 µs | 1.8570 µs | 1.8606 µs |
| Throughput | 8.5992 Melem/s | 8.6161 Melem/s | 8.6269 Melem/s |
| R² | 0.9911043 | 0.9913158 | 0.9907950 |
| Mean | 1.8548 µs | 1.8586 µs | 1.8638 µs |
| Std. Dev. | 7.0628 ns | 23.564 ns | 37.073 ns |
| Median | 1.8536 µs | 1.8556 µs | 1.8569 µs |
| MAD | 4.8025 ns | 6.2518 ns | 7.9833 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.