fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 4.2621 µs | 4.2769 µs | 4.3003 µs |
| Throughput | 7.4414 Melem/s | 7.4820 Melem/s | 7.5081 Melem/s |
| R² | 0.9547133 | 0.9562464 | 0.9524708 |
| Mean | 4.2656 µs | 4.2907 µs | 4.3236 µs |
| Std. Dev. | 45.759 ns | 150.54 ns | 225.67 ns |
| Median | 4.2548 µs | 4.2570 µs | 4.2602 µs |
| MAD | 9.0623 ns | 15.011 ns | 20.023 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.