fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 7.8098 µs | 7.8245 µs | 7.8481 µs |
| Throughput | 8.1549 Melem/s | 8.1794 Melem/s | 8.1949 Melem/s |
| R² | 0.9861404 | 0.9866205 | 0.9853990 |
| Mean | 7.8136 µs | 7.8385 µs | 7.8762 µs |
| Std. Dev. | 31.310 ns | 164.67 ns | 268.31 ns |
| Median | 7.8039 µs | 7.8082 µs | 7.8139 µs |
| MAD | 12.754 ns | 16.101 ns | 22.074 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.