Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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.
The previous logic for distributing remainder tokens,
self.dcp_rank <= (seq_lens[:num_decodes] - 1) % self.dcp_world_size, was flawed. When a sequence lengthLis perfectly divisible by the world sizeW,(L - 1) % Wevaluates toW - 1. This caused the condition to be true for all ranks, incorrectly incrementing each rank's local sequence length by one.The new logic,
self.dcp_rank < seq_lens[:num_decodes] % self.dcp_world_size, correctly handles this. WhenL % W == 0, no rank gets an extra token. When there is a remainder, it is correctly distributed among the firstL % Wranks. This change fixes the bug and ensures correct behavior for all cases.