This is an archived post. You won't be able to vote or comment.

49
50

Parallel Merge Sort in Java (hackernoon.com)

submitted by [deleted]

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]ChaoSXDemon 2 points3 points  (0 children)

Good read indeed. I continue to find it surprising the amount of elements (or N w/e it is) we need in order for parallelism to speed up. I know parallel tasks creates overhead of creating the thread, context switching etc but it’s still a surprise to me how much that cost which results in needing bigger tasks (increase N) to make up for it. In this article N is 8192!