Sciweavers

Share
EUROPAR
2005
Springer

A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers

9 years 4 months ago
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory 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.
Erik G. Boman, Doruk Bozdag, Ümit V. Ç
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where EUROPAR
Authors Erik G. Boman, Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne
Comments (0)
books