fibonacci_recursive/our/256
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 62.255 µs | 62.313 µs | 62.369 µs |
| Throughput | 4.1046 Melem/s | 4.1083 Melem/s | 4.1121 Melem/s |
| R² | 0.9974741 | 0.9975933 | 0.9974822 |
| Mean | 62.077 µs | 62.140 µs | 62.202 µs |
| Std. Dev. | 278.26 ns | 320.77 ns | 362.66 ns |
| Median | 61.973 µs | 62.137 µs | 62.237 µs |
| MAD | 278.19 ns | 385.77 ns | 440.77 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.