fibonacci_recursive/our/512
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 57.810 µs | 57.943 µs | 58.145 µs |
| Throughput | 8.8055 Melem/s | 8.8363 Melem/s | 8.8567 Melem/s |
| R² | 0.9696003 | 0.9703031 | 0.9686924 |
| Mean | 57.840 µs | 58.003 µs | 58.217 µs |
| Std. Dev. | 374.27 ns | 982.24 ns | 1.5049 µs |
| Median | 57.710 µs | 57.743 µs | 57.772 µs |
| MAD | 68.658 ns | 114.18 ns | 161.16 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.