George Karypis, Vipin Kumar  Home/Search
Context Related
| umn.edu/dept/users...l_parallel_ipps.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umn.edu/dept/users/kumar/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we present a parallel formulation of a graph partitioning and sparse matrix ordering algorithm that is based on a multilevel algorithm we developed recently. Our parallel algorithm achieves a speedup of up to 56 on a 128-processorCray T3D for moderate size problems, further reducing its already moderate serial run time. Graphs with over 200,000 vertices can be partitioned in 128 parts, on a 128-processor Cray T3D in less than 3 seconds. This is at least an order of magnitude... (Update)
Context of citations to this paper: More
.... experimental evidence of efficient parallel algorithms for graph partitioning and sparse matrix orderings based on graph partitioning [24]. GP based ordering also aids the parallelization of the factorization and triangular solution phases of a direct solver. Gupta, Karypis, and...
Cited by: More
CONCURRENCY: PRACTICE AND EXPERIENCE,VOL. 9(12).. - Applications In.. (Correct)
Parallel Adaptive Unstructured Computation - Castanos (2000) (Correct)
Highly Scalable Parallel Algorithms for Sparse Matrix.. - Gupta, Karypis, Kumar (1995) (Correct)
Similar documents (at the sentence level): More
69.3%: A Parallel Algorithm for Multilevel Graph Partitioning and.. - Karypis, Kumar (1998) (Correct)
7.6%: A Fast and High Quality Multilevel Scheme for. . . - Karypis, Kumar (1998) (Correct)
6.6%: A Fast And High Quality Multilevel Scheme For Partitioning.. - Karypis, Kumar (1998) (Correct)
Active bibliography (related documents): More All
0.5: A Coarse-Grain Parallel Formulation of Multilevel k-way . . . - Karypis, al. (1997) (Correct)
0.5: A Coarse-Grain Parallel Formulation of Multilevel . . . - Karypis, al. (1997) (Correct)
0.5: Graph Partitioning Based Sparse Matrix Orderings for.. - Gupta (1996) (Correct)
Similar documents based on text: More All
0.2: A Framework for Partitioning Composite Grids - Rantakokko (1998) (Correct)
0.0: Parallel Multilevel Algorithms for Multi-Constraint.. - Schloegel, Karypis.. (1999) (Correct)
0.0: A New Algorithm for Multi-objective Graph Partitioning - Schloegel, Karypis, Kumar (1999) (Correct)
Related documents from co-citation: More All
14: A Multilevel Algorithm for Partitioning Graphs - Hendrickson, Leland
13: An Efficient Heuristic Procedure for Partitioning Graphs (context) - Kernighan, Lin - 1970
12: A Fast and High Quality Multilevel Scheme for Partitioning Irregular
BibTeX entry: (Update)
G. Karypis and V. Kumar. Parallel multilevel graph partitioning. University of Minnesota, Department of Computer Science, May 1995. http://citeseer.ist.psu.edu/karypis95parallel.html More
@techreport{ karypis95parallel,
author = "George Karypis and Vipin Kumar",
title = "Parallel Multilevel Graph Partitioning",
number = "TR 95-036",
year = "1995",
url = "citeseer.ist.psu.edu/karypis95parallel.html" }
Citations (may not include all citations):429 An efficient heuristic procedure for partitioning graphs (context) - Kernighan, Lin - 1970
309 Partitioning sparse matrices with eigenvectors of graphs (context) - Pothen, Simon et al. - 1990
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
186 way partitioning scheme for irregular graphs (context) - Karypis, Kumar - 1995
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
67 A unified geometric approach to graph separators (context) - Miller, Teng et al. - 1991
44 Parallel algorithms for dynamically partitioning unstructure.. - Diniz, Plimpton et al. - 1995
42 Analysis of multilevel graph partitioning - Karypis, Kumar - 1995
33 A parallel graph partitioning algorithm for a message-passin.. (context) - Gilbert, Zmijewski - 1987
32 Parallel multilevel graph partitioning - Karypis, Kumar - 1995
26 Pmrsb: Parallel multilevel recursive spectral bisection - Barnard - 1995
14 A parallel implementation of multilevel recursive spectral b.. (context) - Barnard, Simon - 1995
12 Parallel ordering using edge contraction - Raghavan - 1995
4 Finite element methods on the connection machine cm-5 system (context) - Johan, Mathur et al. - 1993
2 A parallel implementtaion of the multiple minimum degree ord.. (context) - Ghose, Rothberg - 1994
1 Computer Solutionof LargeSparsePositive Definite Systems (context) - Georgeand, Liu - 1981
1 A fast multilevel implementationof recursive spectral bisect.. (context) - Barnard, Simon - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (ftp://ftp.cs.umn.edu/dept/users/kumar/): More
A Survey of Parallel Search Algorithms for Discrete.. - Grama, Kumar (1993) (Correct)
Scalability of Parallel Algorithms for the All-Pairs Shortest.. - Kumar, Singh (1991) (Correct)
Web Page Categorization and Feature Selection.. - Moore, Han.. (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