Speeding up parallel graph coloring

Authors:
Assefaw H. Gebremedhin;Fredrik Manne;Tom Woods
Affiliations:
Computer Science Dept, Old Dominion University, Norfolk, VA;University of Bergen, Bergen, Norway;University of Bergen, Bergen, Norway
Venue:
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Year:
2004

Citing 8
Cited 1

A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
A parallel graph coloring heuristic

SIAM Journal on Scientific Computing
Parallel heuristics for improved, balanced graph colorings

Journal of Parallel and Distributed Computing
Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
Simple distributed&Dgr; + 1-coloring of graphs

Information Processing Letters
Experimental analysis of simple, distributed vertex coloring algorithms

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel Distance-k Coloring Algorithms for Numerical Optimization

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Reducing the bandwidth of sparse symmetric matrices

ACM '69 Proceedings of the 1969 24th national conference

A framework for scalable greedy coloring on distributed-memory parallel computers

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph coloring algorithm and suggest several enhancements both in terms of ordering the vertices so as to minimize cache misses, and performing vertex-to-processor assignments based on graph partitioning instead of random allocation. We report experimental results that demonstrate the performance of our algorithms on an IBM Regatta supercomputer when up to 12 processors are used. Our implementations use OpenMP for parallelization and Metis for graph partitioning. The experiments show that we get up to a 70 % reduction in runtime compared to the previous algorithm.