FractalSortCPU achieves up to 6x better bandwidth efficiency than prior radix sorts on CPUs for 512MB-32GB datasets at 16-bit precision by using compressed histograms and parallel updates without pre-bucketing.
Engineering in-place (shared-memory) sorting algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
FractalSortCPU achieves up to 6x better bandwidth efficiency than prior radix sorts on CPUs for 512MB-32GB datasets at 16-bit precision by using compressed histograms and parallel updates without pre-bucketing.