fibonacci_recursive/our/128
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 15.006 µs | 15.045 µs | 15.094 µs |
| Throughput | 8.4803 Melem/s | 8.5081 Melem/s | 8.5301 Melem/s |
| R² | 0.9800253 | 0.9809124 | 0.9794804 |
| Mean | 15.010 µs | 15.044 µs | 15.084 µs |
| Std. Dev. | 120.88 ns | 190.12 ns | 247.64 ns |
| Median | 14.964 µs | 14.977 µs | 14.986 µs |
| MAD | 29.094 ns | 43.910 ns | 58.293 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.