fibonacci_recursive/our/64
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 16.032 µs | 16.052 µs | 16.078 µs |
| Throughput | 3.9807 Melem/s | 3.9870 Melem/s | 3.9921 Melem/s |
| R² | 0.9963834 | 0.9965950 | 0.9962726 |
| Mean | 16.037 µs | 16.056 µs | 16.078 µs |
| Std. Dev. | 78.763 ns | 103.73 ns | 128.82 ns |
| Median | 16.020 µs | 16.065 µs | 16.085 µs |
| MAD | 61.125 ns | 83.799 ns | 110.58 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.