fibonacci_recursive/our/128
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 14.752 µs | 14.772 µs | 14.801 µs |
| Throughput | 8.6480 Melem/s | 8.6648 Melem/s | 8.6769 Melem/s |
| R² | 0.9918107 | 0.9920572 | 0.9915811 |
| Mean | 14.766 µs | 14.804 µs | 14.855 µs |
| Std. Dev. | 59.215 ns | 230.95 ns | 363.22 ns |
| Median | 14.747 µs | 14.751 µs | 14.762 µs |
| MAD | 23.281 ns | 32.821 ns | 45.044 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.