HARP: A Fast Spectral Partitioner

- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (RSB), have proven effective in generating high-quality partitions of realistically-sized meshes. The major problem which hindered their widespread use was their long execution times. This paper presents a new inertial spectral partitioner, called HARP. The main objective of the proposed approach is to quickly partition the meshes at runtime in a manner that works efficiently for real applications in the context of distributed-memory machines. The underlying principle of HARP is to find the eigenvectors of the unpartitioned vertices and then project them onto the eigenvectors of the original mesh. Results for various meshes ranging in size from 1000 to 100,000 vertices indicate that HARP can indeed partition meshes rapidly at runtime. Experimental results show that our largest mesh can be partitioned sequentia...

• Type: Conference
• Year: 1997
• Where: SPAA
• Authors: Horst D. Simon, Andrew Sohn, Rupak Biswas
• Keywords: Distributed And Parallel Computing, Inertial Spectral Partitioner, Recursive Spectral Bisection, SPAA 1997, Spectral Partitioners