fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 31.353 µs | 31.392 µs | 31.455 µs |
| Throughput | 8.1386 Melem/s | 8.1550 Melem/s | 8.1651 Melem/s |
| R² | 0.9922024 | 0.9924138 | 0.9918617 |
| Mean | 31.363 µs | 31.402 µs | 31.458 µs |
| Std. Dev. | 67.744 ns | 248.15 ns | 391.12 ns |
| Median | 31.341 µs | 31.352 µs | 31.371 µs |
| MAD | 39.005 ns | 52.348 ns | 66.189 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.