Avoid extra loops on sorted data in the __subgroup_bubble_sorter::sort
#1874
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
….h - fix corner case performance issue in the __subgroup_bubble_sorter::sort Signed-off-by: Sergey Kopienko <sergey.kopienko@intel.com>
….h - avoid loops and condition checks for small data sizes in __subgroup_bubble_sorter::sort Signed-off-by: Sergey Kopienko <sergey.kopienko@intel.com>
SergeyKopienko
commented
Sep 24, 2024
include/oneapi/dpl/pstl/hetero/dpcpp/parallel_backend_sycl_merge_sort.h
Outdated
Show resolved
Hide resolved
|
|
||
| _IndexType __n = __end - __start; | ||
|
|
||
| switch (__n) |
There was a problem hiding this comment.
There are no other occurrences of switch in the library. What about using if-else? I guess switch is not necessary here due to having only 4 options.
There was a problem hiding this comment.
I believe switch / case should works faster.
There was a problem hiding this comment.
For large number of elements switch should perform better although I do not know in device code. However, with just 4 cases there's probably no difference.
In my opinion, unless there is a measurable performance difference between switch and if-else, then we should use if-else.
include/oneapi/dpl/pstl/hetero/dpcpp/parallel_backend_sycl_merge_sort.h
Outdated
Show resolved
Hide resolved
include/oneapi/dpl/pstl/hetero/dpcpp/parallel_backend_sycl_merge_sort.h
Outdated
Show resolved
Hide resolved
mmichel11
reviewed
Sep 24, 2024
….h - fix review comment: allow ADL as it was originally Signed-off-by: Sergey Kopienko <sergey.kopienko@intel.com>
….h - fix review comment: the overflow is handled in the caller side, so it does not make sense to make a signed type. Signed-off-by: Sergey Kopienko <sergey.kopienko@intel.com>
….h - fix review comment: additional comments Signed-off-by: Sergey Kopienko <sergey.kopienko@intel.com>
SergeyKopienko
force-pushed
the
dev/skopienko/fix_subgroup_bubble_sorter
branch
from
63136a5
to
658f8df
Compare
SergeyKopienko
commented
Sep 25, 2024
| if (__comp(__second_item, __first_item)) | ||
| { | ||
| using std::swap; | ||
| swap(__first_item, __second_item); | ||
| } | ||
| } | ||
| break; | ||
| default: // The case when __end > __start + 2 three or more source data items require full bubble sort | ||
| do |
There was a problem hiding this comment.
Implementation from https://en.wikipedia.org/wiki/Bubble_sort
# for free
to join this conversation on GitHub.
Already have an account?
# to comment
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.
In this PR we avoid extra loops on sorted data in the
__subgroup_bubble_sorter::sort,which calls in sort algorithms on the device for every work item.
This is beneficial when the data is already sorted, which according to https://en.wikipedia.org/wiki/Sorting_algorithm is a common real-world case.