fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 24.128 µs | 24.160 µs | 24.208 µs |
| Throughput | 10.575 Melem/s | 10.596 Melem/s | 10.610 Melem/s |
| R² | 0.9918995 | 0.9921299 | 0.9916081 |
| Mean | 24.132 µs | 24.183 µs | 24.268 µs |
| Std. Dev. | 74.463 ns | 370.07 ns | 617.68 ns |
| Median | 24.114 µs | 24.122 µs | 24.135 µs |
| MAD | 33.185 ns | 46.745 ns | 64.301 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.