Balanced k-means for Parallel Geometric Partitioning
Moritz von Looz, Charilaos Tzovas, Henning Meyerhenke · 2018
Mesh partitioning is an indispensable tool for efficient parallel numerical simulations. Its goal is to minimize communication between the processes of a simulation while achieving load balance. Established graph-based partitioning tools yield a high solution quality; however, their scalability is limited. Geometric approaches usually scale better, but their solution quality may be unsatisfactory for "non-trivial" mesh topologies.