On Wed, 20 Sep 2023 22:46:16 GMT, Srinivas Vamsi Parasa <d...@openjdk.org> wrote:
> Hi Vladimir, > > Just trying to understand: is there a reason to use > `DualPivotQuicksort_RadixForParallel.java` and > `DualPivotQuicksort_RadixForAll.java`? > > Would it not be sufficient to do the following two runs: > > 1. Baseline (Stock JDK) vs. AVX512 sort for`sort()`and `parallelSort()` ? > 2. AVX512 sort vs. Radix sort for `sort()` and `parallelSort()` ? > > > [1] current implementation in JDK [2] your AVX12 version based on [1], from > > this PR [3] my new version with Radix sort for parallel case plus your > > AVX12 changes [4] my new version with Radix sort for all cases plus your > > AVX12 changes > > Thanks, Vamsi Hi @vamsi-parasa , Please also add C1 intrinsification support for newly carved sort / partition intrinsics in your follow up PR https://bugs.openjdk.org/browse/JDK-8315382 , it may further improve the overall runtime for large sized array sort in tiered compilation mode. ------------- PR Comment: https://git.openjdk.org/jdk/pull/14227#issuecomment-1728877814
