Graph Partitioning Models for Parallel Computing
Journal Article
·
· Parallel Computing
OSTI ID:4179
Calculations can naturally be described as graphs in which vertices represent computation and edges reflect data dependencies. By partitioning the vertices of a graph, the calculation can be divided among processors of a parallel computer. However, the standard methodology for graph partitioning minimizes the wrong metric and lacks expressibility. We survey several recently proposed alternatives and discuss their relative merits.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sandia National Lab. (SNL-CA), Livermore, CA (United States)
- Sponsoring Organization:
- US Department of Energy (US)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 4179
- Report Number(s):
- SAND99-0530J; TRN: AH200113%%102
- Journal Information:
- Parallel Computing, Other Information: Submitted to Parallel Computing; PBD: 2 Mar 1999
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel incremental graph partitioning using linear programming
An improved spectral graph partitioning algorithm for mapping parallel computations
Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning
Book
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:4179
An improved spectral graph partitioning algorithm for mapping parallel computations
Journal Article
·
Wed Mar 01 00:00:00 EST 1995
· SIAM Journal on Scientific Computing
·
OSTI ID:4179
Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning
Journal Article
·
Thu Dec 14 00:00:00 EST 2017
· SIAM Journal on Scientific Computing
·
OSTI ID:4179
+6 more