S-HARP : A Parallel Dynamic Spectral


Computational science problems with adaptive meshes involve dynamic load balancing when implemented on parallel machines. This dynamic load balancing requires fast partitioning of computational meshes at run time. We present in this report a fast parallel dynamic partitioner, called S-HARP. The underlying principles of S-HARP are the fast feature of… (More)

11 Figures and Tables


  • Presentations referencing similar topics