Graph Partitioning Models for Parallel Computing
Journal Article
·
· Parallel Computing
OSTI ID:4179
- Sandia National Laboratories
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 Labs., Albuquerque, NM (US); Sandia National Labs., Livermore, CA (US)
- Sponsoring Organization:
- US Department of Energy (US)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 4179
- Report Number(s):
- SAND99-0530J
- Journal Information:
- Parallel Computing, Journal Name: Parallel Computing
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel hypergraph partitioning for scientific computing.
Parallel incremental graph partitioning using linear programming
Genetic algorithms for graph partitioning and incremental graph partitioning
Conference
·
Fri Jul 01 00:00:00 EDT 2005
·
OSTI ID:968387
Parallel incremental graph partitioning using linear programming
Book
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87650
Genetic algorithms for graph partitioning and incremental graph partitioning
Book
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87649