| Thread Previous • Date Previous • Date Next • Thread Next |
Cause is a non-parallelised InsertionSortCollider, who need about 80% time with 4 threads.The cause is not (only) that it is not parallelized, but that the algorithm scales worse than O(n). You see that for 1 thread collider's percentage gets up with increasing n. Parallelizing the collider will only have very limited effect, and I doubt it is worth the work that would be necessary for that; FYI the trivial "let's sort along the 3 axes in parallel" does not make it any faster. v.
| Thread Previous • Date Previous • Date Next • Thread Next |
