Regular Article
HARP: A Dynamic Spectral Partitioner,☆☆,

https://doi.org/10.1006/jpdc.1998.1445Get rights and content

Abstract

Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such as 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 for the dynamic load balancing framework JOVE which dynamically balances the computational loads of distributed-memory machines with a global view. 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 sequentially in only a few seconds on an SP-2, which is several times faster than other spectral partitioners, while maintaining the solution quality of the proven RSB method. These results indicate that graph partitioning can now be truly embedded in dynamically changing real-world applications.

References (25)

  • C. Farhat

    A simple and efficient automatic FEM domain decomposer

    Computers and Structures

    (1988)
  • C. Farhat et al.

    TOP/DOMDEC: A software tool for mesh partitioning and parallel processing

    Computing Systems in Engineering

    (February 1995)
  • H.D. Simon

    Partitioning of unstructured problems for parallel processing

    Computing Systems in Engineering

    (1991)
  • S.T. Barnard et al.

    Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems

    Concurrency: Practice and Experience

    (1994)
  • T. Chan et al.

    Geometric Spectral Partitioning

    Xerox PARC Technical Report

    (January 1995)
  • W. Chan et al.

    A linear time implementation of the reverse Cuthill–McKee algorithm

    BIT

    (1980)
  • P. Diniz et al.

    Parallel algorithms for dynamically partitioning unstructured grid

    Proc. 7th SIAM Conference on Parallel Processing for Scientific Computing

    (1995)
  • R. Grimes et al.

    A shifted block lanczos algorithm for solving sparse symmetric generalized eigenproblems

    SIAM J. Matrix Anal. Appl.

    (1994)
  • K. Hall

    Anr

    Management Sci.

    (November 1970)
  • B. Hendrickson et al.

    A Multilevel Algorithm for Partitioning Graphs

    Technical Report

    (1993)
  • B. Hendrickson et al.

    Multidimensional Spectral Load Balancing

    Technical Report

    (1993)
  • G. Karypis et al.

    A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

    Technical Report

    (1995)
  • Cited by (0)

    A preliminary version of this report appeared inThe Proceedings of the Ninth ACM Symposium on Parallel Algorithms and Architectures, Newport, Rhode Island, June 1997, pp. 43–52.

    ☆☆

    This work is supported by NASA under Contract NAS 2-14303. E-mail: [email protected].

    A. K. Noor

    *

    This work was supported by the Director, Office of Computational Sciences of the U.S. Department of Energy under Contract DE-AC03-76SF00098. E-mail: [email protected].

    This work is supported in part by the NASA JOVE Program, USRA RIACS, and MRJ Technology Solutions. E-mail: [email protected].

    View full text