An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations

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 ap...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on scientific computing Jg. 16; H. 2; S. 452 - 469
Hauptverfasser:	Hendrickson, Bruce, Leland, Robert
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.03.1995
Schlagworte:	Algorithms Applied sciences Assignment problem Combinatorics Combinatorics. Ordered structures Communication Computer science; control theory; systems Cost control Decomposition Eigenvectors Exact sciences and technology Graph theory Information retrieval. Graph Laboratories Mathematics Methods Methods of scientific computing (including symbolic computation, algebraic computation) Numerical analysis. Scientific computation Optimization Sciences and techniques of general use Theoretical computing Finite element method Parallel algorithm Spectral method Grid pattern Eigenvector Hypercube Decomposition method Graph theory Finite difference method
ISSN:	1064-8275, 1095-7197
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!