Metraipolis › archive › dc_1f2edfdd7c2d
PACO: A Fully Cache-Oblivious Parallel FFT with One Global Redistribution — arXiv:2609.06449
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06449
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T13:07:26.291Z
- SHA-256 of the archived text
cd027a0b84620595bf19139fc183f72b5e61fcb75d1e8b9817e8905fd8690ffc- Stable URL of this page
https://metraipolis.com/documento/dc_1f2edfdd7c2d
How to cite
PACO: A Fully Cache-Oblivious Parallel FFT with One Global Redistribution — arXiv:2609.06449 — arXiv (en), https://arxiv.org/abs/2609.06449 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1f2edfdd7c2d (Metraipolis archive dc_1f2edfdd7c2d, sha256 cd027a0b84620595bf19139fc183f72b5e61fcb75d1e8b9817e8905fd8690ffc)
BibTeX
@misc{dc1f2edfdd7c2d,
title = {PACO: A Fully Cache-Oblivious Parallel FFT with One Global Redistribution — arXiv:2609.06449},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06449},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1f2edfdd7c2d; sha256 cd027a0b84620595bf19139fc183f72b5e61fcb75d1e8b9817e8905fd8690ffc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06449. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Fast Fourier transforms on parallel machines incur two forms of data movement: processor-local transfers through the memory hierarchy and global redistribution between processors. Four-step FFT organizations switch the active transform dimension with one global transpose-like exchange, but this alone does not yield cache-efficient local computation. Cache-oblivious FFTs achieve asymptotically optimal local memory traffic through recursive layout transformations, whose direct materialization can require extra data-rearrangement passes and global exchanges. We present PACO, a fully cache-oblivious parallel FFT framework that reconciles these objectives. PACO executes LocalFFT -> OneGlobalPermutation -> LocalFFT. Its local stages recursively partition both transform and batch dimensions without knowledge of the cache parameters. Rather than materializing the transpose-like layouts induced by this recursion, PACO defers them, showing that they compose into a base-b digit-reversal permutation that is fused with the redistribution already required to change the local transform dimension. The resulting middle stage is a perfectly balanced parallel cache-oblivious digit-reversal permutation in which each source-destination processor pair exchanges exactly $N/p^2$ elements. Under an exact base-b slab decomposition in a hybrid ideal-cache/BSP model, PACO computes an N-point DFT exactly with maximum per-processor work $\Theta((N/p) \log N)$ and maximum per-processor cache complexity $\Theta((N/(pB))(1 + \log_M N))$, using exactly one global redistribution round. PACO returns canonical logical DFT coefficients under a factor-swapped target slab ownership. The single redistribution is necessary under the stated no-replication ownership model, while its communication volume is optimal for the prescribed fused permutation and source-target slab distributions. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-09 in cs.DC). Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2609.06449 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T13:02:21.611Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).