-
Notifications
You must be signed in to change notification settings - Fork 498
Improve rebalance shards algorithm #6018
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
quickwit/quickwit-control-plane/src/ingest/ingest_controller.rs
Outdated
Show resolved
Hide resolved
| ); | ||
| } | ||
| shards_to_move | ||
| shards_to_rebalance |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This function returns the list of shards to move... It does not move stuff itself.
This is nice because it means any sophisticated logic downstream will be applied to place the shard on the right server.
HOWEVER
The code downstream does not enforce your new condition.
This means that as a set : this function + the function that attributes your stuff does not necessarily ever converges. I'm thinking in particular of the code that tries to place shards from the same index on the same indexer.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This logic only exists in the indexing controller. In the ingest controller, the placement logic is much simpler: we allocate shards to the ingesters with the least number of open shards. Right?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Got it!
d38cc07 to
c0c4a8d
Compare
c0c4a8d to
6489c80
Compare
No description provided.