fibonacci_recursive/our/16
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 4.1057 µs | 4.1112 µs | 4.1165 µs |
| Throughput | 3.8868 Melem/s | 3.8918 Melem/s | 3.8970 Melem/s |
| R² | 0.9942939 | 0.9945304 | 0.9943050 |
| Mean | 4.0882 µs | 4.0946 µs | 4.1016 µs |
| Std. Dev. | 24.449 ns | 34.467 ns | 44.679 ns |
| Median | 4.0756 µs | 4.0871 µs | 4.1067 µs |
| MAD | 22.544 ns | 33.090 ns | 38.166 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.