Possible performance issue with router planner worker eliminations
Open
- Dominant language
- C
- Stars
- 12.8k
- Forks
- 794
- Avg merge
- 2d 14h
- Merged PRs (30d)
- 31
Description
multi_router_planner.c:IntersectPlacementList() uses O(n^2) algorithm to determine placements list for encountered shards. This complexity could be reduced by using a different algorithm, combination of hash lookup and bitmapset.
Contributor guide
Assessment
This issue has not been assessed yet.