fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 7.9895 µs | 8.0090 µs | 8.0344 µs |
| Throughput | 7.9658 Melem/s | 7.9910 Melem/s | 8.0105 Melem/s |
| R² | 0.9600821 | 0.9608518 | 0.9595357 |
| Mean | 8.0008 µs | 8.0338 µs | 8.0757 µs |
| Std. Dev. | 77.175 ns | 194.09 ns | 282.61 ns |
| Median | 7.9775 µs | 7.9832 µs | 7.9913 µs |
| MAD | 16.921 ns | 24.026 ns | 31.441 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.