fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 29.057 µs | 29.303 µs | 29.604 µs |
| Throughput | 8.6474 Melem/s | 8.7362 Melem/s | 8.8103 Melem/s |
| R² | 0.8672059 | 0.8749537 | 0.8634699 |
| Mean | 29.045 µs | 29.178 µs | 29.343 µs |
| Std. Dev. | 342.65 ns | 771.12 ns | 1.0934 µs |
| Median | 28.950 µs | 28.960 µs | 28.977 µs |
| MAD | 44.549 ns | 62.005 ns | 87.598 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.