You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Thank you for your great work on x86-simd-sort! I noticed that on May 29, a pull request titled "Adds OpenMP based parallelization to key-value sorting" was merged, which added OpenMP-based parallelization to key-value sorting and brought significant performance improvements for large arrays.
However, it seems that qsort in the library does not yet include similar thread-level parallelization.
Adding OpenMP-based parallelization to qsort could yield significant performance improvements. Would it be possible to extend the same parallelization approach to qsort in the future?
The text was updated successfully, but these errors were encountered:
Thank you for your great work on x86-simd-sort! I noticed that on May 29, a pull request titled "Adds OpenMP based parallelization to key-value sorting" was merged, which added OpenMP-based parallelization to key-value sorting and brought significant performance improvements for large arrays.
However, it seems that qsort in the library does not yet include similar thread-level parallelization.
Adding OpenMP-based parallelization to qsort could yield significant performance improvements. Would it be possible to extend the same parallelization approach to qsort in the future?
The text was updated successfully, but these errors were encountered: