-
Notifications
You must be signed in to change notification settings - Fork 1.3k
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
Parallel merge sort (#6162) #6308
Conversation
I plan to review this carefully tomorrow morning |
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 code looks great. Thank you @tustvold
I agree some benchmarks are in order but I think the code itself is great.
mut input: SendableRecordBatchStream, | ||
buffer: usize, | ||
) -> SendableRecordBatchStream { | ||
// Use tokio only if running from a tokio context (#2201) |
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.
Nice
.map(|partition| self.input.execute(partition, context.clone())) | ||
.collect::<Result<_>>()?, | ||
}; | ||
let receivers = (0..input_partitions) |
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 looks beautiful
It isn't a huge win, but I'll take it
There is no change the merge benches and the benches for primitive arrays (as they don't use SortPreservingMerge) |
I think we should merge it |
Which issue does this PR close?
Closes #6162
Rationale for this change
What changes are included in this PR?
Are these changes tested?
Will run benchmarks prior to merge
Are there any user-facing changes?