fibonacci_recursive/our/128
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 15.433 µs | 15.462 µs | 15.499 µs |
| Throughput | 8.2588 Melem/s | 8.2782 Melem/s | 8.2940 Melem/s |
| R² | 0.9917761 | 0.9922701 | 0.9915121 |
| Mean | 15.430 µs | 15.458 µs | 15.497 µs |
| Std. Dev. | 68.996 ns | 175.90 ns | 274.98 ns |
| Median | 15.413 µs | 15.420 µs | 15.433 µs |
| MAD | 27.292 ns | 36.919 ns | 50.043 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.