fibonacci_recursive/our/128
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 12.215 µs | 12.229 µs | 12.251 µs |
| Throughput | 10.448 Melem/s | 10.467 Melem/s | 10.479 Melem/s |
| R² | 0.9956842 | 0.9958647 | 0.9954195 |
| Mean | 12.212 µs | 12.222 µs | 12.234 µs |
| Std. Dev. | 28.635 ns | 57.209 ns | 85.335 ns |
| Median | 12.207 µs | 12.211 µs | 12.215 µs |
| MAD | 13.343 ns | 17.224 ns | 23.345 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.