Ring-buffer shuffle achieves amortized O(1) synchronization per batch and O(M) memory use, outperforming prior methods by up to 300% on 192-core systems in query engine benchmarks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
One Ring to Shuffle Them All: Scalable Intra-Process Data Redistribution with Ring-Buffer Shuffle in Redpanda Oxla
Ring-buffer shuffle achieves amortized O(1) synchronization per batch and O(M) memory use, outperforming prior methods by up to 300% on 192-core systems in query engine benchmarks.