fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 4.7809 µs | 4.7898 µs | 4.8042 µs |
| Throughput | 6.6608 Melem/s | 6.6809 Melem/s | 6.6933 Melem/s |
| R² | 0.9896147 | 0.9900780 | 0.9888377 |
| Mean | 4.7801 µs | 4.7871 µs | 4.7964 µs |
| Std. Dev. | 12.287 ns | 42.229 ns | 63.131 ns |
| Median | 4.7758 µs | 4.7775 µs | 4.7798 µs |
| MAD | 5.9159 ns | 8.2103 ns | 10.672 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.