fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 5.2668 µs | 5.2714 µs | 5.2775 µs |
| Throughput | 12.127 Melem/s | 12.141 Melem/s | 12.152 Melem/s |
| R² | 0.9962750 | 0.9963816 | 0.9961972 |
| Mean | 5.2696 µs | 5.2747 µs | 5.2815 µs |
| Std. Dev. | 14.090 ns | 30.854 ns | 48.070 ns |
| Median | 5.2687 µs | 5.2722 µs | 5.2747 µs |
| MAD | 9.8671 ns | 13.190 ns | 16.252 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.