Skip to content
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

Optimize sorting using Quick-Merge sort #702

Closed
wants to merge 1 commit into from

Conversation

loveDengFeng
Copy link

Pull Request

What problem does this PR solve?

Issue Number: Fixed #

Possible side effects?

  • Performance:

  • Backward compatibility:

Copy link

CLA Assistant Lite bot:
Thank you for your submission, we really appreciate it. Like many open-source projects, we ask that you sign our Contributor License Agreement before we can accept your contribution. You can sign the CLA by just posting a Pull Request Comment same as the below format.


I have read the CLA Document and I hereby sign the CLA


You can retrigger this bot by commenting recheck in this Pull Request

@tpppppub
Copy link
Member

Your implementation requires an efficient shuffle kernel, and odd_even_merge_sort will be called only when the protocol does not support an efficient shuffle kernel. Otherwise, a radix sort algorithm will be called. So your code will not work in SPU.

@deadlywing deadlywing self-requested a review May 24, 2024 02:57
Copy link

Stale pull request message. Please comment to remove stale tag. Otherwise this pr will be closed soon.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants