The Community for Technology Leaders
2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (2012)
Shanghai, China China
May 21, 2012 to May 25, 2012
ISBN: 978-1-4673-0974-5
pp: 1744-1753
ABSTRACT
Graph coloring algorithms are commonly used in large scientific parallel computing either for identifying parallelism or as a tool to reduce computation, such as compressing Hessian matrices. Large scientific computations are nowadays either run on commodity clusters or on large computing platforms. In both cases, the current target platform is hierarchical with distributed memory at the node level and shared memory at the processor level. In this paper, we present a novel hybrid graph coloring algorithm and discuss how to obtain the best performance on such systems from algorithmic, system and engineering perspectives.
INDEX TERMS
Instruction sets, Image color analysis, Multicore processing, Resource management, Clustering algorithms, Partitioning algorithms, Hybrid programming, Graph algorithm, Graph coloring, Distributed Memory, Shared Memory
CITATION

A. E. Sariyüce, E. Saule and U. V. Catalyurek, "Scalable Hybrid Implementation of Graph Coloring Using MPI and OpenMP," 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum(IPDPSW), Shanghai, China China, 2012, pp. 1744-1753.
doi:10.1109/IPDPSW.2012.216
170 ms
(Ver 3.3 (11022016))