On Sun, 22 Oct 2023 17:26:52 GMT, Laurent Bourgès wrote:
>> * improved mixed insertion sort (makes whole sorting faster)
>> * introduced Radix which sort shows several times boost of performance and
>> has linear complexity instead of n*ln(n)
>> * improved merging sort for almost sorted data
>>
On Sun, 22 Oct 2023 17:26:52 GMT, Laurent Bourgès wrote:
>> * improved mixed insertion sort (makes whole sorting faster)
>> * introduced Radix which sort shows several times boost of performance and
>> has linear complexity instead of n*ln(n)
>> * improved merging sort for almost sorted data
>>
On Sun, 22 Oct 2023 17:26:52 GMT, Laurent Bourgès wrote:
>> * improved mixed insertion sort (makes whole sorting faster)
>> * introduced Radix which sort shows several times boost of performance and
>> has linear complexity instead of n*ln(n)
>> * improved merging sort for almost sorted data
>>
On Sun, 22 Oct 2023 17:26:52 GMT, Laurent Bourgès wrote:
>> * improved mixed insertion sort (makes whole sorting faster)
>> * introduced Radix which sort shows several times boost of performance and
>> has linear complexity instead of n*ln(n)
>> * improved merging sort for almost sorted data
>>
On Mon, 10 Mar 2025 06:48:49 GMT, Per Minborg wrote:
>> Laurent Bourgès has updated the pull request incrementally with one
>> additional commit since the last revision:
>>
>> add @SuppressWarnings (serial)
>
> Hi. I've seen this PR being worked on for a long time. Did you discuss the
> moti
On Sun, 22 Oct 2023 17:26:52 GMT, Laurent Bourgès wrote:
>> * improved mixed insertion sort (makes whole sorting faster)
>> * introduced Radix which sort shows several times boost of performance and
>> has linear complexity instead of n*ln(n)
>> * improved merging sort for almost sorted data
>>
On Sun, 22 Oct 2023 17:26:52 GMT, Laurent Bourgès wrote:
>> * improved mixed insertion sort (makes whole sorting faster)
>> * introduced Radix which sort shows several times boost of performance and
>> has linear complexity instead of n*ln(n)
>> * improved merging sort for almost sorted data
>>
On Sun, 22 Oct 2023 17:26:52 GMT, Laurent Bourgès wrote:
>> * improved mixed insertion sort (makes whole sorting faster)
>> * introduced Radix which sort shows several times boost of performance and
>> has linear complexity instead of n*ln(n)
>> * improved merging sort for almost sorted data
>>
On Sun, 22 Oct 2023 17:26:52 GMT, Laurent Bourgès wrote:
>> * improved mixed insertion sort (makes whole sorting faster)
>> * introduced Radix which sort shows several times boost of performance and
>> has linear complexity instead of n*ln(n)
>> * improved merging sort for almost sorted data
>>
On Sun, 22 Oct 2023 17:26:52 GMT, Laurent Bourgès wrote:
>> * improved mixed insertion sort (makes whole sorting faster)
>> * introduced Radix which sort shows several times boost of performance and
>> has linear complexity instead of n*ln(n)
>> * improved merging sort for almost sorted data
>>
On Fri, 10 May 2024 22:08:47 GMT, Srinivas Vamsi Parasa
wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> Could you please run the new benchmarking to finalize the best version?
>> What you need is to compile and run JavaBenchmarkHarness:
>>
>> javac --patch-module java.base=. -d classes *.java
>>
On Sun, 22 Oct 2023 17:26:52 GMT, Laurent Bourgès wrote:
>> * improved mixed insertion sort (makes whole sorting faster)
>> * introduced Radix which sort shows several times boost of performance and
>> has linear complexity instead of n*ln(n)
>> * improved merging sort for almost sorted data
>>
On Mon, 6 May 2024 23:26:49 GMT, Srinivas Vamsi Parasa wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> Could you please run the new benchmarking to detect the best case
>> for Radix sort and parallel sorting?
>>
>> What you need is to compile and run JavaBenchmarkHarness:
>>
>> javac --patch-modu
On Sun, 21 Apr 2024 04:37:45 GMT, Srinivas Vamsi Parasa
wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> Could you please run the new benchmarking?
>> To save time and don't patch JDK several times, I've created
>> JavaBenchmarkHarness
>> class which is under package java.util and compares several
On Sun, 21 Apr 2024 04:37:45 GMT, Srinivas Vamsi Parasa
wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> Could you please run the new benchmarking?
>> To save time and don't patch JDK several times, I've created
>> JavaBenchmarkHarness
>> class which is under package java.util and compares several
On Mon, 11 Mar 2024 19:31:45 GMT, Srinivas Vamsi Parasa
wrote:
>> Hi Vladimir (@iaroslavski),
>>
>> Please see the data below.
>>
>> Thanks,
>> Vamsi
>>
>> > xmlns:o="urn:schemas-microsoft-com:office:office"
>> xmlns:x="urn:schemas-microsoft-com:office:excel"
>> xmlns="http://www.w3.org/TR/RE
On Fri, 16 Feb 2024 23:43:15 GMT, Srinivas Vamsi Parasa
wrote:
>> Hi Vamsi (@vamsi-parasa),
>>
>> My fault, there was an incorrect version of ArraysSortNew.java. Methods, of
>> course, should be
>>
>> @Benchmark
>> public void sort() {
>> Arrays.sort(b);
>> }
>>
>> @Benchmark
>> public v
On Thu, 8 Feb 2024 01:54:45 GMT, Srinivas Vamsi Parasa wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> Many thanks for the results! Now we can see that intrinsics are applied in
>> all cases,
>> but there are big differences between the same code.
>>
>> For example,
>> parallelSort REPEATED 2
On Fri, 2 Feb 2024 20:09:57 GMT, Srinivas Vamsi Parasa wrote:
>> Hi Vamsi (@vamsi-parasa), Laurent(@bourgesl),
>>
>> The latest benchmarking compares compares the following versions:
>> jdk - direct call of Arrays.sort();
>> a15 - the current source of DualPivotQuicksort from the latest build (e
On Fri, 26 Jan 2024 17:19:25 GMT, Srinivas Vamsi Parasa
wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> Could you please run the benchmarking of new DQPS in your environment with
>> AVX?
>>
>> Take all classes below and put them in the package
>> org.openjdk.bench.java.util.
>> ArraysSort class
On Fri, 26 Jan 2024 17:19:25 GMT, Srinivas Vamsi Parasa
wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> Could you please run the benchmarking of new DQPS in your environment with
>> AVX?
>>
>> Take all classes below and put them in the package
>> org.openjdk.bench.java.util.
>> ArraysSort class
On Mon, 11 Dec 2023 03:42:51 GMT, Srinivas Vamsi Parasa
wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> I made the process simpler: added all variants to be compared into
>> ArraysSort class
>> (set the same package org.openjdk.bench.java.util). It will run all sorts
>> incl. sort from jdk
>> in
On Mon, 11 Dec 2023 03:42:51 GMT, Srinivas Vamsi Parasa
wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> I made the process simpler: added all variants to be compared into
>> ArraysSort class
>> (set the same package org.openjdk.bench.java.util). It will run all sorts
>> incl. sort from jdk
>> in
On Fri, 8 Dec 2023 01:27:35 GMT, Srinivas Vamsi Parasa wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> Did you have a chance to run benchmarking?
>
> Hi Vladimir (@iaroslavski),
>
> Please see the data below.
>
> Thanks,
> Vamsi
>
> xmlns:o="urn:schemas-microsoft-com:office:office"
> xmlns:x="u
On Fri, 8 Dec 2023 01:27:35 GMT, Srinivas Vamsi Parasa wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> Did you have a chance to run benchmarking?
>
> Hi Vladimir (@iaroslavski),
>
> Please see the data below.
>
> Thanks,
> Vamsi
>
> xmlns:o="urn:schemas-microsoft-com:office:office"
> xmlns:x="u
On Tue, 28 Nov 2023 00:35:48 GMT, Srinivas Vamsi Parasa
wrote:
>> Laurent Bourgès has updated the pull request incrementally with one
>> additional commit since the last revision:
>>
>> add @SuppressWarnings (serial)
>
> xmlns:o="urn:schemas-microsoft-com:office:office"
> xmlns:x="urn:schem
On Tue, 28 Nov 2023 00:35:48 GMT, Srinivas Vamsi Parasa
wrote:
>> Laurent Bourgès has updated the pull request incrementally with one
>> additional commit since the last revision:
>>
>> add @SuppressWarnings (serial)
>
> xmlns:o="urn:schemas-microsoft-com:office:office"
> xmlns:x="urn:schem
On Tue, 28 Nov 2023 00:35:48 GMT, Srinivas Vamsi Parasa
wrote:
>> Laurent Bourgès has updated the pull request incrementally with one
>> additional commit since the last revision:
>>
>> add @SuppressWarnings (serial)
>
> xmlns:o="urn:schemas-microsoft-com:office:office"
> xmlns:x="urn:schem
On Mon, 27 Nov 2023 21:17:24 GMT, Srinivas Vamsi Parasa
wrote:
> > Hello Vamsi (@vamsi-parasa),
> > Do you have the new results?
>
> Hi Vladimir (@iaroslavski),
>
> Sorry for the delay as I was on vacation the whole of last week. Will provide
> the data today by EOD (US pacific time). (Looks
On Fri, 17 Nov 2023 23:14:18 GMT, Srinivas Vamsi Parasa
wrote:
>> Hello Vamsi (@vamsi-parasa),
>>
>> Thank you very much for benchmarking, I appreciate your efforts!
>>
>> I looked at non-parallel sorting when radix sort is switched off
>> (DualPivotQuicksort_RadixForParallel) and cannot expl
On Thu, 16 Nov 2023 22:08:41 GMT, Srinivas Vamsi Parasa
wrote:
>> Laurent Bourgès has updated the pull request incrementally with one
>> additional commit since the last revision:
>>
>> add @SuppressWarnings (serial)
>
> Comparision of Stock JDK ( with AVX512sort) vs. Radix sort for All
> (
On Thu, 9 Nov 2023 18:12:36 GMT, Srinivas Vamsi Parasa wrote:
>> Hello @PaulSandoz and @AlanBateman !
>>
>> Did you have time to look at the latest benchmarking?
>
> Hello Vladimir (@iaroslavski)
>
> Will provide the performance data using AVX512 sort as baseline by early next
> week.
> (Frid
On Fri, 27 Oct 2023 13:26:33 GMT, Vladimir Yaroslavskiy
wrote:
>>> Hi Paul (@PaulSandoz), Alan (@AlanBateman), Any update? Do you agree with
>>> Radix sort in parallel case only?
>>
>> I think its definitely a better fit, but another aspect of my previous
>&
Hi Vamsi
May be too late but there is one question. We have 2 new methods
private static void sort(Class elemType, A array, ...
private static int[] partition(Class elemType, A array, ...
and 4 methods which are passed to them:
mixedInsertionSort, insertionSort, partitionDualPivot, partitionDua
34 matches
Mail list logo
