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.

Sign up for GitHub

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

Jump to bottom

Fix performance issue (assumption) #2019

Open

SergeyKopienko opened this issue Jan 24, 2025 · 0 comments

Contributor

SergeyKopienko commented Jan 24, 2025

Based on comment from @mmichel11 https://github.com/uxlfoundation/oneDPL/pull/1977/files#r1927788860 :

the proposal is to change

i_elem_local = i_elem % (__n_sorted * 2);

to

i_elem_local = i_elem & (__n_sorted * 2 - 1)

SergeyKopienko mentioned this issue

Optimize merge_sort algorithm for largest data sizes #1977

Open

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