fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 29.487 µs | 29.532 µs | 29.597 µs |
| Throughput | 8.6496 Melem/s | 8.6686 Melem/s | 8.6817 Melem/s |
| R² | 0.9882425 | 0.9885486 | 0.9878921 |
| Mean | 29.479 µs | 29.528 µs | 29.594 µs |
| Std. Dev. | 99.546 ns | 299.21 ns | 458.65 ns |
| Median | 29.452 µs | 29.464 µs | 29.488 µs |
| MAD | 45.848 ns | 55.042 ns | 80.369 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.