fibonacci_recursive/our/16
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.4403 µs | 1.4417 µs | 1.4433 µs |
| Throughput | 11.086 Melem/s | 11.098 Melem/s | 11.109 Melem/s |
| R² | 0.9956157 | 0.9957447 | 0.9955786 |
| Mean | 1.4413 µs | 1.4438 µs | 1.4470 µs |
| Std. Dev. | 6.1601 ns | 14.746 ns | 21.460 ns |
| Median | 1.4400 µs | 1.4409 µs | 1.4418 µs |
| MAD | 3.2147 ns | 4.4678 ns | 5.4882 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.