Answers are grounded in this paper and cite their sources.
We introduce a data distribution scheme for H-matrices and a distributed-memory algorithm for H-matrix-vector multiplication. Our data distribution scheme avoids an expensive Ω(P²) scheduling procedure used in previous work, where P is the number of processes, while data balancing is well-preserved. Based on the data distribution, our distributed-memory algorithm evenly distributes all computations among P processes and adopts a novel tree-communication algorithm to reduce the latency cost. The overall complexity of our algorithm is O(Nlog N/P +αlog P+βlog²P) for H-matrices under weak admissibility condition, where N is the matrix size, $α$ denotes the latency, and $β$ denotes the inverse bandwidth. Numerically, our algorithm is applied to address both two- and three-dimensional problems of various sizes among various numbers of processes. On thousands of processes, good parallel efficiency is still observed.
No takes yet. Share an insight, caveat, or question.
Li et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: