Mirror/powersort
1
0
Fork 0
mirror of https://gitlab.uni-marburg.de/langbeid/powersort.git synced 2025-01-21 19:50:35 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

benchmark: JMH SortEnum

Browse Source
This commit is contained in:
Daniel Langbein 2024-12-11 18:05:12 +00:00
parent 060ff596b8
commit e3b90c83cc
Signed by: langfingaz
GPG Key ID: 6C47C753F0823002
3 changed files with 10 additions and 34 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
app/src/jmh/java/de/uni_marburg/powersort/benchmark/DummySortBenchmark.java
View File

@ -1,10 +0,0 @@
package de.uni_marburg.powersort.benchmark;
import de.uni_marburg.powersort.sort.DummySort;
public class DummySortBenchmark extends AbstractBenchmark {
@Override
public void sort() {
DummySort.sort(workingCopy, 0, workingCopy.length, NaturalOrder.INSTANCE, null, 0, 0);
}
}

24
app/src/jmh/java/de/uni_marburg/powersort/benchmark/AbstractBenchmark.java → app/src/jmh/java/de/uni_marburg/powersort/benchmark/MainJmh.java
View File

@ -2,6 +2,7 @@ package de.uni_marburg.powersort.benchmark;
import de.uni_marburg.powersort.data.DataEnum; import de.uni_marburg.powersort.data.DataEnum;
import de.uni_marburg.powersort.data.ObjectSupplier; import de.uni_marburg.powersort.data.ObjectSupplier;
import de.uni_marburg.powersort.sort.SortEnum;
import org.openjdk.jmh.annotations.Benchmark; import org.openjdk.jmh.annotations.Benchmark;
import org.openjdk.jmh.annotations.BenchmarkMode; import org.openjdk.jmh.annotations.BenchmarkMode;
import org.openjdk.jmh.annotations.Fork; import org.openjdk.jmh.annotations.Fork;
@ -33,33 +34,28 @@ import java.util.concurrent.TimeUnit;
* State objects naturally encapsulate the state on which benchmark is working on. * State objects naturally encapsulate the state on which benchmark is working on.
*/ */
@State(Scope.Benchmark) @State(Scope.Benchmark)
public abstract class AbstractBenchmark { public class MainJmh {
@Param() @Param()
private DataEnum dataEnum; private DataEnum dataEnum;
@Param()
private SortEnum sortEnum;
private DataEnum prevDataEnum = null;
private ObjectSupplier data; private ObjectSupplier data;
/* package-protected */ Object[] workingCopy; /* package-protected */ Object[] workingCopy;
// TODO: This is inaccurate. How to create and use separate arrays for each warmup x iteration x sortAlgorithm ? // TODO: This is inaccurate. How to create and use separate arrays for each warmup x iteration x sortAlgorithm ?
@Setup(Level.Invocation) @Setup(Level.Invocation)
public void setup() { public void setup() {
if (dataEnum != prevDataEnum){ // TODO: We tried to store the old `dataEnum` in a separate variable and only call `dataEnum.get()` if `dataEnum` changed. But the separate variable was always reverted to `null`. Why? Maybe as the benchmark method does not use it?
System.out.println(prevDataEnum + " => " + dataEnum); // TODO: This leads to different random lists used for each sort impl.
prevDataEnum = dataEnum; //
data = dataEnum.get(); // TODO: This is better anyways: Store random list on disk and reuse it for reproducibility
} data = dataEnum.get();
workingCopy = data.getCopy(); workingCopy = data.getCopy();
} }
@Benchmark @Benchmark
public void benchmark() { public void benchmark() {
sort(); sortEnum.get().sort(workingCopy);
} }
/**
* Sorts this.array with some sorting algorithm.
*/
/* package-protected */ abstract void sort();
} }

10
app/src/jmh/java/de/uni_marburg/powersort/benchmark/MergeSortBenchmark.java
View File

@ -1,10 +0,0 @@
package de.uni_marburg.powersort.benchmark;
import de.uni_marburg.powersort.sort.MergeSort;
public class MergeSortBenchmark extends AbstractBenchmark {
@Override
public void sort() {
MergeSort.legacyMergeSort(workingCopy, NaturalOrder.INSTANCE);
}
}