A scalable parallel graph coloring algorithm for distributed memory computers

Authors:
Erik G. Boman;Doruk Bozdağ;Umit Catalyurek;Assefaw H. Gebremedhin;Fredrik Manne
Affiliations:
Sandia National Laboratories;Ohio State University;Ohio State University;Old Dominion University;University of Bergen, Norway
Venue:
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Year:
2005

Citing 8
Cited 5

A parallel graph coloring heuristic

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

Journal of Parallel and Distributed Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific 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
Parallel Scientific Computation: A Structured Approach Using BSP and MPI

Parallel Scientific Computation: A Structured Approach Using BSP and MPI
Metrics and models for reordering transformations

MSP '04 Proceedings of the 2004 workshop on Memory system performance

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

Journal of Parallel and Distributed Computing
Parallel graph component labelling with GPUs and CUDA

Parallel Computing
Self-stabilizing algorithm of two-hop conflict resolution

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
PLDS: Partitioning linked data structures for parallelism

ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
A parallel distance-2 graph coloring algorithm for distributed memory computers

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributed-memory algorithm for doing the coloring itself in parallel. The algorithm operates in an iterative fashion; in each round vertices are speculatively colored based on limited information, and then a set of incorrectly colored vertices, to be recolored in the next round, is identified. Parallel speedup is achieved in part by reducing the frequency of communication among processors. Experimental results on a PC cluster using up to 16 processors show that the algorithm is scalable.