fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 19.515 µs | 19.547 µs | 19.588 µs |
| Throughput | 13.069 Melem/s | 13.097 Melem/s | 13.118 Melem/s |
| R² | 0.9934596 | 0.9938261 | 0.9931970 |
| Mean | 19.516 µs | 19.538 µs | 19.565 µs |
| Std. Dev. | 73.490 ns | 127.01 ns | 167.73 ns |
| Median | 19.500 µs | 19.509 µs | 19.517 µs |
| MAD | 27.510 ns | 36.999 ns | 43.336 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.