Bruce Hendrickson, Robert Leland  Home/Search
Context Related
| 139.179.10.16/prv/...ectral_Theory.ps.z 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: 139.179.10.16/prv/ftp/Reports/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. We present a new domain mapping algorithm that extends recent work in which ideas from spectral graph theory have been applied to this problem. Our generalization of spectral graph bisection involves a novel use of multiple eigenvectors to allow for division of a computation into four or eight parts at each stage of a... (Update)
Cited by: More
Partitioning and Dynamic Load Balancing for the.. - Teresco, Devine.. (Correct)
A Multilevel Algorithm for the Minimum 2-sum Problem - Safro, Ron, Brandt (2006) (Correct)
Value Balanced Agglomerative Connectivity Clustering - Gupta, Ghosh (2001) (Correct)
Active bibliography (related documents): More All
1.0: Multidimensional Spectral Load Balancing - Hendrickson, Leland (1993) (Correct)
0.4: The Chaco User's Guide Version 1.0 - Hendrickson, Leland (1994) (Correct)
0.4: A Multilevel Algorithm for Partitioning Graphs - Hendrickson, Leland (1993) (Correct)
Similar documents based on text: More All
0.1: Knowledge Mining With VxInsight: Discovery Through Interaction - George Davidson Bruce (1998) (Correct)
0.1: Partitioning Rectangular And Structurally Nonsymmetric.. - Hendrickson, Kolda (1998) (Correct)
0.1: Partitioning Rectangular And Structurally Unsymmetric.. - Hendrickson, Kolda (2000) (Correct)
Related documents from co-citation: More All
69: Partitioning sparse matrices with eigenvectors of graphs (context) - Pothen, Simon et al. - 1990
43: Partitioning of unstructured problems for parallel processing - Simon - 1991
41: A fast multilevel implementation of recursive spectral bisection for partitionin.. - Barnard, Simon - 1989
BibTeX entry: (Update)
B. Hendrickson and R. Leland. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. Sci. Comput., 16:452--469, 1995. http://citeseer.ist.psu.edu/hendrickson95improved.html More
@article{ hendrickson95improved,
author = "Bruce Hendrickson and Robert Leland",
title = "An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations",
journal = "{SIAM} Journal on Scientific Computing",
volume = "16",
number = "2",
pages = "452--469",
year = "1995",
url = "citeseer.ist.psu.edu/hendrickson95improved.html" }
Citations (may not include all citations):686 Practical Methods of Optimization (context) - Fletcher - 1986
650 Numerical methods for unconstrained optimization and nonline.. (context) - Dennis, Schnabel - 1983
441 The Symmetric Eigenvalue Problem (context) - Parlett - 1980
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
309 Partitioning sparse matrices with eigenvectors of graphs (context) - Pothen, Simon et al. - 1990
225 Some simplified NP-complete graph problems (context) - Garey, Johnson et al. - 1976
219 Partitioning of unstructured problems for parallel processin.. - Simon - 1991
144 Performance of dynamic load balancing algorithms for unstruc.. - Williams - 1991
108 Algebraic connectivity of graphs (context) - Fiedler - 1973
88 Eigenvalues and graph bisection: An average case analysis (context) - Boppana - 1987
70 The Laplacian spectrum of graphs (context) - Mohar - 1988
67 A unified geometric approach to graph separators (context) - Miller, Teng et al. - 1991
43 Solving finite element equations on concurrent computers (context) - Nour-Omid, Raefsky et al. - 1986
41 A projection technique for partitioning the nodes of a graph - Rendl, Wolkowicz - 1990
28 Mapping unstructured grid computations to massively parallel.. (context) - Hammond - 1992
20 Algorithms for partitioning of graphs and computer logic bas.. (context) - Donath, Hoffman - 1972
19 Physical optimization algorithms for mapping data to distrib.. (context) - Mansour - 1992
19 An algorithm for quadrisection and its application to standa.. (context) - Suaris, Kedem - 1988
12 Geometric algorithms for a minimum cost assignment problem (context) - Tokuyama, Nakano - 1991
11 Graph partitioning by eigenvectors (context) - Powers - 1988
9 An improved spectral load balancing method (context) - Hendrickson, Leland - 1993
6 A time--stepping algorithm for parallel computers (context) - Womble - 1990
5 Czechoslovak Math (context) - of, nonnegative et al. - 1975
3 Sandia National Laboratories (context) - load, Tech et al. - 1993
2 Personal Communication (context) - Barth - 1991
1 A genetic approach to network partitioning (context) - Jin, Chan - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://139.179.10.16/prv/ftp/Reports/sandia/): More
An Efficient Parallel Algorithm for Matrix-Vector.. - Hendrickson, Leland.. (1995) (Correct)
The Molecule Problem Exploiting Structure in Global Optimization - Hendrickson (1995) (Correct)
Parallel Many-Body Simulations Without All-to-All.. - Bruce Hendrickson.. (1993) (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