fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 6.7517 µs | 6.7605 µs | 6.7751 µs |
| Throughput | 9.4463 Melem/s | 9.4667 Melem/s | 9.4791 Melem/s |
| R² | 0.9925353 | 0.9927699 | 0.9921320 |
| Mean | 6.7519 µs | 6.7589 µs | 6.7684 µs |
| Std. Dev. | 17.065 ns | 42.792 ns | 66.106 ns |
| Median | 6.7478 µs | 6.7489 µs | 6.7507 µs |
| MAD | 6.1505 ns | 9.4331 ns | 11.567 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.