An improved spectral graph partitioning algorithm for mapping parallel computations

Volume: 16, Issue: 2, Pages: 452 - 469
Published: Mar 1, 1995
Abstract
Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. A new domain mapping algorithm is presented that extends recent work in which ideas from spectral graph theory have been applied to this problem. The generalization of spectral graph bisection involves a novel use of multiple eigenvectors to allow for division of a...
Paper Details
Title
An improved spectral graph partitioning algorithm for mapping parallel computations
Published Date
Mar 1, 1995
Volume
16
Issue
2
Pages
452 - 469
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.