fibonacci_recursive/our/16
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 3.1044 µs | 3.1109 µs | 3.1205 µs |
| Throughput | 5.1274 Melem/s | 5.1432 Melem/s | 5.1540 Melem/s |
| R² | 0.9873712 | 0.9879636 | 0.9866934 |
| Mean | 3.1036 µs | 3.1118 µs | 3.1246 µs |
| Std. Dev. | 11.339 ns | 55.944 ns | 92.184 ns |
| Median | 3.1013 µs | 3.1035 µs | 3.1052 µs |
| MAD | 7.0557 ns | 10.474 ns | 12.499 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.