fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 25.121 µs | 25.174 µs | 25.242 µs |
| Throughput | 10.142 Melem/s | 10.169 Melem/s | 10.191 Melem/s |
| R² | 0.9879654 | 0.9885828 | 0.9875728 |
| Mean | 25.113 µs | 25.148 µs | 25.190 µs |
| Std. Dev. | 119.13 ns | 199.44 ns | 264.83 ns |
| Median | 25.089 µs | 25.103 µs | 25.119 µs |
| MAD | 53.416 ns | 71.683 ns | 103.04 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.