In #24735 (comment) I wrote:
Suppose we have a benchmark with high variance. We use our estimates to try to get near the benchtime. We are more likely to exceed the benchtime if we get a particularly slow run. A particularly fast run is more likely to trigger another benchmark run.
The current approach thus introduces bias.
One simple way to fix this would be to decide when our estimate is going to be "close enough", that is, when we are one iteration way from being done, and then stick with that final iteration even if it falls short of the benchtime.
This issue is to follow up on this concern, independently of #24735, which is really about something else.
In #24735 (comment) I wrote:
This issue is to follow up on this concern, independently of #24735, which is really about something else.