All Questions
5 questions
2
votes
1
answer
85
views
Multithreaded Merge Sort Using ForkJoin Framework
I've implemented a multithreaded merge sort using Java's ForkJoin framework, and I wanted to gather feedback on its correctness, efficiency, and scalability.
Here's my implementation:
...
- 21
5
votes
1
answer
1k
views
Multi-threaded in-place Mergesort on Java
What is an efficient way to implement the Mergesort algorithm in Java such that it meets the following criteria:
Must be multi-threaded.
Must retain the Mergesort time complexities.
Must be in-place ...
2
votes
1
answer
85
views
Parallel curvesort in Java
What?
I have designed curvesort, an algorithm that adapts to "smoothness" of data. For example, if the data resembles a sine wave, it is likely that curvesort will sort it fast. This post is about a ...
- 31k
5
votes
1
answer
9k
views
Parallel merge sort in Java
I have rolled my own parallel merge sort. My performance figures are as follows:
Seed: 1457521330571
java.util.Arrays.sort() in 6840 ms. Sorted: true
java.util.Arrays.parallelSort() 3777 ms. Sorted: ...
- 31k
3
votes
1
answer
1k
views
Parallel MSD radix sort in Java
I have this parallel implementation of MSD radix sort, which processes the entries by one particular byte. At each byte index, it has three phases:
Count the bucket sizes.
Insert each entry to its ...
- 31k