Two algorithms achieve efficient exclusive scans in one-ported message-passing models by combining inclusive scans with adjustments or by modifying round-optimal all-reduce based on bit counts in p-1.
Optimal broadcast schedules in logarithmic time with applications to broadcast, reduction, all-broadcast and all-reduction.ACM Transactions on Parallel Computing, 12(3):1–21
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Two Efficient Message-passing Exclusive Scan Algorithms
Two algorithms achieve efficient exclusive scans in one-ported message-passing models by combining inclusive scans with adjustments or by modifying round-optimal all-reduce based on bit counts in p-1.