fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 8.4632 µs | 8.4726 µs | 8.4834 µs |
| Throughput | 3.7721 Melem/s | 3.7769 Melem/s | 3.7811 Melem/s |
| R² | 0.9968779 | 0.9970493 | 0.9968226 |
| Mean | 8.4604 µs | 8.4714 µs | 8.4859 µs |
| Std. Dev. | 30.172 ns | 66.419 ns | 102.67 ns |
| Median | 8.4553 µs | 8.4584 µs | 8.4620 µs |
| MAD | 15.664 ns | 19.888 ns | 23.777 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.