A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Communication Reducing Algorithms for Distributed Hierarchical N-Body Problems with Boundary Distributions
[article]
2017
arXiv
pre-print
Reduction of communication and efficient partitioning are key issues for achieving scalability in hierarchical N-Body algorithms like FMM. In the present work, we propose four independent strategies to improve partitioning and reduce communication. First of all, we show that the conventional wisdom of using space-filling curve partitioning may not work well for boundary integral problems, which constitute about 50 an alternative method which modifies orthogonal recursive bisection to solve the
arXiv:1702.05459v1
fatcat:h3qbc2kem5cgzpdbpuctvr74mq