Scalable parallel graph coloring algorithms

Finding a good graph coloring quickly is often a crucial phase in the development of efficient, parallel algorithms for many scientific and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast parallel...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Concurrency (Chichester, England.) Ročník 12; číslo 12; s. 1131 - 1146
Hlavní autori: Gebremedhin, Assefaw Hadish, Manne, Fredrik
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Chichester, UK John Wiley & Sons, Ltd 01.10.2000
Predmet:
graph coloring
OpenMP
parallel algorithms
shared memory programming
ISSN:1040-3108, 1096-9128
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Finding a good graph coloring quickly is often a crucial phase in the development of efficient, parallel algorithms for many scientific and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast parallel graph coloring heuristic that is well suited for shared memory programming and yields an almost linear speedup on the PRAM model. We also present a second heuristic that improves on the number of colors used. The heuristics have been implemented using OpenMP. Experiments conducted on an SGI Cray Origin 2000 supercomputer using very large graphs from finite element methods and eigenvalue computations validate the theoretical run‐time analysis. Copyright © 2000 John Wiley & Sons, Ltd.
Bibliografia:ArticleID:CPE528
ark:/67375/WNG-H53VQBBS-6
istex:192C8DE70F28DEEDF6DD9FEE614748557B6A9892
SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISSN:1040-3108
1096-9128
DOI:10.1002/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2