fibonacci_recursive/our/512
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 61.914 µs | 62.011 µs | 62.153 µs |
| Throughput | 8.2377 Melem/s | 8.2566 Melem/s | 8.2695 Melem/s |
| R² | 0.9927508 | 0.9930820 | 0.9923638 |
| Mean | 61.913 µs | 61.975 µs | 62.054 µs |
| Std. Dev. | 164.88 ns | 364.81 ns | 549.21 ns |
| Median | 61.865 µs | 61.910 µs | 61.930 µs |
| MAD | 101.06 ns | 134.79 ns | 157.02 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.