Abstract
We propose a distributed, unordered, label-correcting distance-1 vertex coloring algorithm, called Distributed Control (DC) coloring algorithm. DC eliminates the need for vertex-centric barriers and global synchronization for color refinement, relying only on atomic operations and local termination detection to update vertex color. We implement our DC coloring algorithm and the well-known Jones-Plassmann algorithm in the AM++ AMT runtime and compare their performance. We show that, with runtime support, the elimination of waiting time of vertex-centric barriers and investing this time for local ordering results in better execution time for power-law graphs with dense local subgraphs.
- G. E. Blelloch, J. T. Fineman, and J. Shun. Greedy Sequential Maximal Independent Set and Matching Are Parallel on Average. In Proc. 24th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, pages 308--317, New York, NY, USA, 2012. ACM. Google Scholar
Digital Library
- M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some Simplified NP-complete Problems. In Proc. 6th Annual ACM Symposium on Theory of Computing, STOC '74, pages 47--63, New York, NY, USA, 1974. ACM. Google Scholar
Digital Library
- Q. Ho, J. Cipar, H. Cui, S. Lee, J. K. Kim, P. B. Gibbons, G. A. Gibson, G. Ganger, and E. Xing. More Effective Distributed ML Via A Stale Synchronous Parallel Parameter Server. In Advances in Neural Information Processing Systems, pages 1223--1231, 2013. Google Scholar
Digital Library
- M. T. Jones and P. E. Plassmann. A Parallel Graph Coloring Heuristic. SIAM J. Sci. Comput., 14(3):654--669, May 1993. ISSN 1064-8275. Google Scholar
Digital Library
- M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. In Proc. 17th Annual ACM Symposium on Theory of Computing, STOC '85, pages 1--10. ACM, 1985. ISBN 0-89791-151-2. Google Scholar
Digital Library
Index Terms
(auto-classified)A scalable distance-1 vertex coloring algorithm for power-law graphs
Recommendations
On the existence of graphs which can colour every regular graph
AbstractLet H and G be graphs. An H-colouring of G is a proper edge-colouring f : E ( G ) → E ( H ) such that for any vertex u ∈ V ( G ) there exists a vertex v ∈ V ( H ) with f ∂ G u = ∂ H v, where ∂ G u and ∂ H v respectively denote the sets ...
Colouring exact distance graphs of chordal graphs
AbstractFor a graph G = ( V , E ) and positive integer p, the exact distance- p graph G [ ♮ p ] is the graph with vertex set V and with an edge between vertices x and y if and only if x and y have distance p. ...
On Hedetniemi's conjecture and the colour template scheme
Hedetniemi's conjecture states that the chromatic number of a product of graphs is the minimum of the chromatic numbers of the factors. El-Zahar and Sauer (Combinatorica 5 (1985) 121) have shown that the chromatic number of a product of 4-chromatic ...







Comments