Fast shared-memory streaming multilevel graph partitioning

Nazanin Jafari, Oguz Selvitopi, Cevdet Aykanat

Abstract: Highlights•We propose a parallel multilevel graph partitioner based on a flexible streaming algorithm.•The same streaming algorithm is utilized within each of the three stages of the multilevel partitioning process.•By adopting a streaming-based approach for partitioning, we offer a tradeoff between speed and quality.•Our approach is five times faster than a very common offline partitioner while it degrades the quality only by a factor of two.