fibonacci_recursive/our/512
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 48.155 µs | 48.290 µs | 48.522 µs |
| Throughput | 10.552 Melem/s | 10.603 Melem/s | 10.632 Melem/s |
| R² | 0.9810474 | 0.9818520 | 0.9794876 |
| Mean | 48.143 µs | 48.225 µs | 48.331 µs |
| Std. Dev. | 181.51 ns | 488.49 ns | 725.96 ns |
| Median | 48.097 µs | 48.114 µs | 48.137 µs |
| MAD | 49.527 ns | 77.277 ns | 99.890 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.