fibonacci_recursive/our/512
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 73.501 µs | 73.617 µs | 73.804 µs |
| Throughput | 6.9373 Melem/s | 6.9549 Melem/s | 6.9659 Melem/s |
| R² | 0.9909489 | 0.9912807 | 0.9904141 |
| Mean | 73.489 µs | 73.560 µs | 73.663 µs |
| Std. Dev. | 161.28 ns | 460.62 ns | 741.89 ns |
| Median | 73.439 µs | 73.455 µs | 73.473 µs |
| MAD | 57.396 ns | 87.323 ns | 116.24 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.