fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 29.509 µs | 29.541 µs | 29.583 µs |
| Throughput | 8.6535 Melem/s | 8.6660 Melem/s | 8.6754 Melem/s |
| R² | 0.9904142 | 0.9905742 | 0.9902897 |
| Mean | 29.516 µs | 29.580 µs | 29.672 µs |
| Std. Dev. | 95.297 ns | 409.79 ns | 660.72 ns |
| Median | 29.484 µs | 29.498 µs | 29.509 µs |
| MAD | 33.298 ns | 52.455 ns | 65.993 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.