(Enter summary)
Abstract: We discuss algorithms for graph bisection which are relevant to the distribution of
tasks, such as the elements and nodes of an unstructured mesh to the processors of
a parallel computer.
Starting with a cost function consisting of a part to ensure equal numbers of tasks
for each processor, and a part to minimize communication time between
processors, we derive the spectral bisection method, which consists of finding an
eigenvector of a large sparse matrix.
Inertial bisection is derived as a... (Update)
Context of citations to this paper: More
.... the computation load has to be balanced among the different processors and the amount of communication has to be minimized [53, 24, 55, 60, 32, 26]. The bisection problem is of great relevance in VLSI design because it models the problem of optimally placing standard cells...
...the process continues recursively until p partitions are generated. A more elaborated geometric approach is inertial method [7, 14]. It employs a physical analogy in which the grid points are treated as point masses and the grid is cut with a plane orthogonal to the...
Cited by: More
Relaxed Implementation of Spectral Methods for Graph.. - Chengzhong Xu And
(Correct)
Greedy, Prohibition, and Reactive Heuristics for Graph.. - Battiti, Bertossi (1998)
(Correct)
Active bibliography (related documents): More All
0.3: Software Tool for - Partitioning and Parallel Processing - Farhat, Lanteri
(Correct)
0.3: Automatic Partitioning Techniques for Solving Partial.. - Galtier (1996)
(Correct)
0.1: PLUM: Parallel Load Balancing for Unstructured Adaptive Meshes - Oliker (1998)
(Correct)
Similar documents based on text: More All
0.0: Encoding Information Packaging Information in HPSG - Suresh Manandhar (1994)
(Correct)
0.0: Mobile Ambients -Annex- - Cardelli (1997)
(Correct)
0.0: Identifying Modules Via Concept Analysis - Siff (1997)
(Correct)
Related documents from co-citation: More All
2: A fast multilevel implementation of recursive spectral bisection for partitionin..
- Barnard, Simon - 1989
2: An improved spectral graph partitioning algorithm for mapping parallel computati..
- Hendrickson, Leland - 1995
2: A Multilevel Algorithm for Partitioning Graphs
- Hendrickson, Leland
BibTeX entry: (Update)
R. Williams, "Unification of Spectral and Inertial Bisection," Techn. Rep., Caltech, 1994. Available at: http://www.cacr.caltech.edu/roy/papers/ GREEDY, PROHIBITION, AND REACTIVE HEURISTICS FOR GRAPH PARTITIONING 36 http://citeseer.ist.psu.edu/williams94unification.html More
@techreport{ williams94unification,
author = "Roy Williams",
title = "Unification of Spectral and Inertial Bisection",
number = "CCSF-48",
year = "1994",
url = "citeseer.ist.psu.edu/williams94unification.html" }
Citations (may not include all citations):
309
Partitioning Sparse Matrices with Eigenvectors of Graphs (context) - Pothen, Simon et al. - 1990
209
Computer Science Press (context) - Even, Algorithms - 1979
144
Performance of Dynamic Load Balancing Algorithms for Unstruc..
- Williams - 1991
108
Algebraic Connectivity of Graphs (context) - Fiedler - 1973
92
A Property of Eigenvectors of Non-negative Symmetric Matrice.. (context) - Fiedler - 1975
88
Eigenvalues and Graph Bisection: an Average Case Analysis (context) - Boppana - 1987
11
Fast Mapping and Remapping Algorithm for Irregular and Adapt..
- Ou, Ranka et al.
3
A Fast Implementation of Recursive Spectral Bisection for Pa.. (context) - Barnard, Simon - 1993
http://www.nas.nasa.gov/RNR/People/hsimon/RNR-93-012/RNR-93-012.ps
Documents on the same site (http://www.cacr.caltech.edu/~roy/papers/index.html): More
Approaches to Federation of Astronomical Data - Williams
(Correct)
Distributed Irregular Finite Elements - Williams, Glowinski (1989)
(Correct)
Hypercube Simulation of Electric Fish Potentials - Williams, Rasnow, Assad (1990)
(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