fibonacci_recursive/our/16
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 2.8288 µs | 2.8341 µs | 2.8433 µs |
| Throughput | 5.6273 Melem/s | 5.6456 Melem/s | 5.6560 Melem/s |
| R² | 0.9887960 | 0.9892585 | 0.9878217 |
| Mean | 2.8284 µs | 2.8337 µs | 2.8419 µs |
| Std. Dev. | 5.7634 ns | 35.932 ns | 58.947 ns |
| Median | 2.8270 µs | 2.8284 µs | 2.8291 µs |
| MAD | 3.4773 ns | 5.0373 ns | 6.1684 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.