fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 24.196 µs | 24.237 µs | 24.293 µs |
| Throughput | 10.538 Melem/s | 10.562 Melem/s | 10.580 Melem/s |
| R² | 0.9922261 | 0.9926126 | 0.9918796 |
| Mean | 24.197 µs | 24.238 µs | 24.296 µs |
| Std. Dev. | 73.224 ns | 258.45 ns | 413.36 ns |
| Median | 24.178 µs | 24.187 µs | 24.194 µs |
| MAD | 22.641 ns | 28.664 ns | 37.630 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.