fibonacci_recursive/our/8
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.4054 µs | 1.4074 µs | 1.4099 µs |
| Throughput | 5.6741 Melem/s | 5.6843 Melem/s | 5.6924 Melem/s |
| R² | 0.9900198 | 0.9902958 | 0.9898568 |
| Mean | 1.4055 µs | 1.4081 µs | 1.4116 µs |
| Std. Dev. | 7.1888 ns | 15.911 ns | 24.288 ns |
| Median | 1.4039 µs | 1.4053 µs | 1.4063 µs |
| MAD | 4.3449 ns | 5.8819 ns | 7.0282 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.