This bug is for performing the binary search backfill with the sherlock bot. We need to discuss exactly how we'll implement the logic for this. One possibility is that we could do a "parallelized" search where instead of triggering it on one push at a time, we could do it on 3 to get a quicker answer. This has the disadvantage of reducing the amount of benefit we see in terms of CI resource usage reductions. The advantage would be quicker answers for the culprit commit. There are other questions/changes that we may need to make in terms of the backfill reporting in sherlock to be sure that we can handle the new checks from integrating the change detection techniques.
Bug 2007112 Comment 0 Edit History
Note: The actual edited comment in the bug view page will always show the original commenter’s name and original timestamp.
This bug is for performing the binary search backfill with the sherlock bot. We need to discuss exactly how we'll implement the logic for this. One possibility is that we could do a "parallelized" search where instead of triggering it on one push at a time, we could do it on 3 to get a quicker answer. This has the disadvantage of reducing the amount of benefit we see in terms of CI resource usage reductions. The advantage would be quicker answers for the culprit commit. We could also do this with one part as parallelized, and another part through a more sequential approach. There are other questions/changes that we may need to make in terms of the backfill reporting in sherlock to be sure that we can handle the new checks from integrating the change detection techniques.