fibonacci_recursive/our/128
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 10.301 µs | 10.313 µs | 10.331 µs |
| Throughput | 12.390 Melem/s | 12.411 Melem/s | 12.427 Melem/s |
| R² | 0.9950748 | 0.9952582 | 0.9948953 |
| Mean | 10.300 µs | 10.319 µs | 10.349 µs |
| Std. Dev. | 35.815 ns | 130.90 ns | 216.31 ns |
| Median | 10.297 µs | 10.301 µs | 10.314 µs |
| MAD | 23.958 ns | 31.970 ns | 41.120 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.