fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 20.359 µs | 20.384 µs | 20.419 µs |
| Throughput | 12.538 Melem/s | 12.559 Melem/s | 12.574 Melem/s |
| R² | 0.9954818 | 0.9956828 | 0.9952819 |
| Mean | 20.369 µs | 20.400 µs | 20.445 µs |
| Std. Dev. | 55.012 ns | 199.63 ns | 321.55 ns |
| Median | 20.360 µs | 20.368 µs | 20.374 µs |
| MAD | 30.255 ns | 41.965 ns | 55.482 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.