HoustonPutman commented on PR #15436: URL: https://github.com/apache/lucene/pull/15436#issuecomment-3662408110
For less concurrent searching, the optimization would be more impactful if the list of concurrent search tasks was also sorted before being submitted to the TaskExecutor probably. The `slices()` calculation already uses implicit sorting to evenly distribute the size of the leaf slices, so this could be added there instead to order both the slice partitions as well as the array of LeafSlices returned, so that the executor will try to search the slices in the optimal order. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
