Graph partitioning for high-performance scientific simulations
Kirk Schloegel, George Karypis, Vipin Kumar · University of Minnesota Digital Conservancy (University of Minnesota) · 2003
Algorithms that find good partitionings of unstructured and irregular graphs are critical for the efficient execution of scientific simulations on high performance parallel computers. This paper presents an overview of graph partitioning algorithms. Recent developments in graph partitioning for adaptive and dynamic simulations, as well as partitioning algorithms for sophisticated simulations such as multi-phase, multi-physics, and multi-mesh computations are also discussed.