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...
Gespeichert in:
| Veröffentlicht in: | Concurrency (Chichester, England.) Jg. 12; H. 12; S. 1131 - 1146 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Chichester, UK
John Wiley & Sons, Ltd
01.10.2000
|
| Schlagworte: | |
| ISSN: | 1040-3108, 1096-9128 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| Bibliographie: | 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 |