Abstract

The parallel construction of maximal independent sets is a useful building block for many algorithms in the computational sciences, including graph coloring and multigrid coarse grid creation on unstructured meshes. We present an efficient asynchronous maximal independent set algorithm for use on parallel computers, for "well partitioned" graphs, that arise from finite element models. For appropriately partitioned bounded degree graphs, it is shown that the running time of our algorithm under the PRAM computational model is O(1), which is an improvement over the previous best PRAM complexity for this class of graphs. We present numerical experiments on an IBM SP, that confirm our PRAM complexity model is indicative of the performance one can expect with practical partitions on graphs from finite element problems. Key words: maximal independent sets, multigrid, parallel algorithms, graph coloring AMS(MOS) subject classification: 65F10, 65F50, 65Y05, 68Q22, 68R10, 05C85 1 Intr...

Citations

376	Multilevel k-way partitioning scheme for irregular graphs - Karypis, Kumar - 1998
334	A simple parallel algorithm for the maximal independent set problem - Luby - 1986
301	The Finite Element Method - Zienkiewicz - 1977
293	New method to color the vertices of a graph - Brelaz - 1979
169	Fundamentals of Computer Algorithms - Horowitz, Sahni - 1978
96	Deterministic coin tossing with applications to optimal parallel list ranking - Cole, Vishkin - 1986
91	PETSc 2.0 users manual - Balay, Gropp, et al. - 2001
83	Geometric mesh partitioning: Implementation and experiments - Gilbert, Miller, et al. - 1998
66	A Parallel Graph Coloring Heuristic - Jones, Plassmann - 1993
11	The Finite Element Method, 4th ed - Zienkiewicz, Taylor - 1989
4	Heuristics for the automatic construction of coarse grids in multigrid solvers for finite element matrices - Adams - 1998
1	Parallel symetry-breaking in sparse graphs - Goldberg, Plotkin, et al. - 1987