fibonacci_recursive/our/16
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 2.4394 µs | 2.4424 µs | 2.4461 µs |
| Throughput | 6.5411 Melem/s | 6.5510 Melem/s | 6.5589 Melem/s |
| R² | 0.9931855 | 0.9933757 | 0.9930710 |
| Mean | 2.4401 µs | 2.4518 µs | 2.4689 µs |
| Std. Dev. | 10.412 ns | 76.528 ns | 122.53 ns |
| Median | 2.4379 µs | 2.4394 µs | 2.4415 µs |
| MAD | 5.5314 ns | 7.2387 ns | 10.040 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.