fibonacci_recursive/our/8
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.4074 µs | 1.4114 µs | 1.4171 µs |
| Throughput | 5.6451 Melem/s | 5.6681 Melem/s | 5.6842 Melem/s |
| R² | 0.9386927 | 0.9397007 | 0.9376301 |
| Mean | 1.4072 µs | 1.4140 µs | 1.4240 µs |
| Std. Dev. | 6.9284 ns | 44.335 ns | 71.743 ns |
| Median | 1.4051 µs | 1.4061 µs | 1.4073 µs |
| MAD | 3.3163 ns | 4.2978 ns | 5.6390 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.