SaschaWitt/ips4o
View on GitHub ↗ ★ 169 C++
In-place Parallel Super Scalar Samplesort (IPS⁴o)
8 mentions on Hacker News by 6 people: 2 stories, 6 comments · first 2018-08-31 · latest 2022-01-30
20082026
-
…is significantly slower (I just tried it). But I have to admit defeat to this Sample sort : https://github.com/SaschaWitt/ips4o
comment by chkas · 2022-01-30 · in Hoare’s Rebuttal and Bubble Sort’s Comeback -
For sorting, not really. The big development in compute power is parallelism. ips4o facto ( https://github.com/SaschaWitt/ips4o ), if you want to sort large vectors really fast it makes more sense to sort in-place and in parallel. Parallel…
comment by inciampati · 2021-07-18 · in Do Low-Level Optimizations Matter? (2020) -
▲ 2
Ips4o: In-place parallel superscalar samplesortstory by fanf2 · 2020-10-19 · 0 comments
-
…sorting algorithm: "In-place Parallel Super Scalar Samplesort (IPS4o)" which we started using: https://github.com/SaschaWitt/ips4o https://arxiv.org/abs/1705.02257 As an example, to sort 10 million random longs on my computer it takes…
comment by ipsofacto · 2020-05-17 · in Lomuto's Comeback -
▲ 1
SaschaWitt/Ips4o: In-Place Parallel Super Scalar Samplesort (IPS⁴o)story by polskibus · 2020-04-10 · 0 comments
-
…really tricky when you want to use parallel architectures to speed it up. Case in point: ips4o, https://github.com/SaschaWitt/ips4o
comment by inciampati · 2020-01-30 · in Sorting Algorithms in C -
…prediction is a big one, parallelism is also an obvious win if you can make use of it, etc), e.g. https://github.com/SaschaWitt/ips4o/ (sequential and parallel, disclaimer: the authors are my colleagues) or https://github.com/orlp/pdqsort…
comment by lorenzhs · 2020-01-20 · in Why is quicksort better than other sorting algorithms in practice? (2013) -
…behaviour of modern CPUs into account, check out ips4o ( https://arxiv.org/abs/1705.02257 , code: https://github.com/SaschaWitt/ips4o ) or for a simpler algorithm that's still much faster than quicksort in most cases, blockquicksort (…
comment by lorenzhs · 2018-08-31 · in On the Worst-Case Complexity of TimSort