(Enter summary)
Abstract: In this paper we present a parallel formulation of the multilevel graph partitioning and sparse matrix ordering
algorithm. A key feature of our parallel formulation (that distinguishes it from other proposed parallel formulations of
multilevel algorithms is that it partitions the vertices of the graph into p p parts while distributing the overall adjacency
matrix of the graph among all p processors. This mapping results in substantially smaller communication than onedimensional
distribution for ... (Update)
Context of citations to this paper: More
.... be solved by implementing the load balancing with two steps: First, the total grid is mapped on the SMP nodes (e.g. by using ParMETIS [14] with the number of nodes) and second, on each node, the grid cells for the node are distributed to the MPI processes belonging to the...
Cited by: More
Practical Parallel Algorithms for Some Tree and - Graph Problems In (1999)
(Correct)
WSMP: A High-Performance Shared- and Distributed-Memory.. - Gupta, Joshi (2001)
(Correct)
Multi-Constraint Mesh Partitioning for Contact/Impact - Computations George Karypis
(Correct)
Similar documents (at the sentence level):
75.8%: A Parallel Algorithm for Multilevel Graph Partitioning and.. - Karypis, Kumar (1998)
(Correct)
32.5%: Parallel Multilevel Graph Partitioning - Karypis, Kumar (1995)
(Correct)
Active bibliography (related documents): More All
0.4: Parallel Multilevel k-way Partitioning Scheme for Irregular.. - Karypis, Kumar (1996)
(Correct)
0.4: A Coarse-Grain Parallel Formulation of Multilevel k-way . . . - Karypis, al. (1997)
(Correct)
0.4: A Coarse-Grain Parallel Formulation of Multilevel . . . - Karypis, al. (1997)
(Correct)
Similar documents based on text: More All
0.6: Multilevel k-way Partitioning Scheme for Irregular Graphs - Karypis, Kumar
(Correct)
0.4: September 20, 1998 - Metis Mee Tis
(Correct)
0.3: METIS - Unstructured Graph Partitioning and Sparse Matrix.. - Karypis, Kumar (1995)
(Correct)
Related documents from co-citation: More All
11: way partitioning scheme for irregular graphs (context) - Karypis, Kumar et al. - 1996
8: Jacobi-Davidson implementation for solving large eigenproblems on coarse grain e.. (context) - Stathopoulos, McCombs et al. - 1999
8: Iterative Methods for Sparse Linear Systems (context) - Saad - 1996
BibTeX entry: (Update)
Karypis, G. & Kumar, V. A parallel algorithm for multilevel graph partitioning and sparse matrix reordering. Journal of Parallel and Distributed Computing, vol. 48 (1998) pp. 71-95. http://citeseer.ist.psu.edu/article/karypis98parallel.html More
@article{ karypis98parallel,
author = "George Karypis and Vipin Kumar",
title = "A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering",
journal = "Journal of Parallel and Distributed Computing",
volume = "48",
number = "1",
pages = "71--95",
year = "1998",
url = "citeseer.ist.psu.edu/article/karypis98parallel.html" }
Citations (may not include all citations):
429
An efficient heuristic procedure for partitioning graphs (context) - Kernighan, Lin - 1970
421
A linear time heuristic for improving network partitions (context) - Fiduccia, Mattheyses - 1982
346
Computer Solution of Large Sparse Positive Definite Systems (context) - George, Liu - 1981
288
Introduction to Parallel Computing: Design and Analysis of A.. (context) - Kumar, Grama et al. - 1994
244
A multilevel algorithm for partitioning graphs
- Hendrickson, Leland - 1993
222
A fast multilevel implementation of recursive spectral bisec..
- Barnard, Simon - 1993
199
A simple parallel algorithm for the maximal independent set .. (context) - Luby - 1986
186
way partitioning scheme for irregular graphs (context) - Karypis, Kumar et al. - 1996
186
way partitioning scheme for irregular graphs (context) - Karypis, Kumar - 1997
165
Sandia National Laboratories (context) - Hendrickson, Leland et al. - 1993
78
A heuristic for reducing fill in sparse matrix factorization (context) - Bui, Jones - 1993
74
Modification of the minimum degree algorithm by multiple eli.. (context) - Liu - 1985
57
Highly scalable parallel algorithms for sparse matrix factor..
- Gupta, Karypis et al. - 1997
44
Parallel algorithms for dynamically partitioning unstructure..
- Diniz, Plimpton et al. - 1995
42
How good is recursive bisection
- Simon, Teng - 1993
42
Analysis of multilevel graph partitioning
- Karypis, Kumar - 1995
36
Computing the block triangular form of a sparse matrix (context) - Pothen, Fan - 1990
33
Finding clusters in VLSI circuits (context) - Garbers, Promel et al. - 1990
26
Pmrsb: Parallel multilevel recursive spectral bisection
- Barnard - 1995
26
A fast and highly quality multilevel scheme for partitioning.. (context) - Karypis, Kumar - 1995
22
Parallelism in graph partitioning (context) - Savage, Wloka - 1991
14
A parallel implementation of multilevel recursive spectral b.. (context) - Barnard, Simon - 1995
12
Parallel ordering using edge contraction
- Raghavan - 1995
11
Graph contraction and physical optimization methods: a quali.. (context) - Ponnusamy, Mansour et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-users.cs.umn.edu/~karypis/metis/publications/main.html): More
Multilevel k-way Partitioning Scheme for Irregular Graphs - Karypis, Kumar (1998)
(Correct)
A Fast and High Quality Multilevel Scheme for. . . - Karypis, Kumar (1998)
(Correct)
Multilevel Diffusion Schemes for Repartitioning of.. - Schloegel, Karypis, Kumar (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC