A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs
Pages 420 - 431
Abstract
In this paper, we propose a distributed, unordered, label-correcting distance-1 Grundy (vertex) coloring algorithm, namely, Distributed Control (DC) coloring algorithm. Our algorithm 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. DC proceeds optimistically, correcting the colors asynchronously as the algorithm progresses and depends on local ordering of tasks to minimize the execution of sub-optimal work. We implement our DC coloring algorithm and the well-known Jones-Plassmann algorithm and compare their performance with 4 different types of standard RMAT graphs and real-world graphs. We show that the elimination of waiting time of global and vertex-centric barriers and investing this time for local ordering leads to improved scaling for graphs with prominent power-law characteristics and densely interconnected local subgraphs.
References
[1]
K. Lang, "Fixing two weaknesses of the spectral method", in Advances in Neural Information Processing Systems, 2006, pp. 715--722.
[2]
P. Erdos, R. L. Graham, and E. Szemeredi, "On sparse graphs with dense long paths", Comp. and Math. with Appl, vol. 1, pp. 145--161, 1975.
[3]
M. Luby, "A Simple Parallel Algorithm for the Maximal Independent Set Problem", in Proc. 17th Annual ACM Symposium on Theory of Computing, ser. STOC '85. New York, NY, USA: ACM, 1985, pp. 1--10.
[4]
M. T. Jones and P. E. Plassmann, "A Parallel Graph Coloring Heuristic", SIAM J. Sci. Comput., vol. 14, no. 3, pp. 654--669, May 1993.
[5]
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, ser. SPAA'12. ACM, 2012, pp. 308--317.
[6]
J. S. Firoz, M. Zalewski, T. A. Kanewala, and A. Lumsdaine, "Synchronization-avoiding graph algorithms", in 25th International Conference on High Performance Computing (HiPC). IEEE, 2018.
[7]
A. H. Gebremedhin and F. Manne, "Scalable parallel graph coloring algorithms", Concurrency - Practice and Experience, vol. 12, no. 12, pp. 1131--1146, 2000.
[8]
M. Kulkarni and K. Pingali, "Scheduling issues in optimistic parallelization", in Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International. IEEE, 2007, pp. 1--7.
[9]
J. J. Willcock, T. Hoefler, N. G. Edmonds, and A. Lumsdaine, "AM++: A Generalized Active Message Framework", in Proce. 19th Int. Conf. on Parallel Architectures and Compilation Techniques. ACM, 2010, pp. 401--410.
[10]
Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola, and J. M. Hellerstein, "Distributed graphlab: A framework for machine learning and data mining in the cloud", Proc. VLDB Endow., vol. 5, no. 8, pp. 716--727, Apr. 2012.
[11]
W. Hasenplaugh, T. Kaler, T. B. Schardl, and C. E. Leiserson, "Ordering heuristics for parallel graph coloring", in Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, ser. SPAA '14. New York, NY, USA: ACM, 2014, pp. 166--177.
[12]
L. Lovsz, M. Saks, and W. T. Trotter, "An on-line graph coloring algorithm with sublinear performance ratio", Discrete Math., vol. 75, no. 1--3, pp. 319--325, Sep. 1989.
[13]
T. F. Coleman and J. J. Moré, "Estimation of sparse jacobian matrices and graph coloring blems", SIAM journal on Numerical Analysis, vol. 20, no. 1, pp. 187--209, 1983.
[14]
D. Brélaz, "New methods to color the vertices of a graph", Commun. ACM, vol. 22, no. 4, pp. 251--256, Apr. 1979.
[15]
S. Sallinen, K. Iwabuchi, S. Poudel, M. Gokhale, M. Ripeanu, and R. Pearce, "Graph colouring as a challenge problem for dynamic graph processing on distributed systems", in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, ser. SC '16. Piscataway, NJ, USA: IEEE Press, 2016, pp. 30:1--30:12.
[16]
A. B. Sinha, L. V. Kale, and B. Ramkumar, "A dynamic and adaptive quiescence detection algorithm", University of Illinois at Urbana-Champaign, Urbana-Champaign, 1993.
[17]
D. Chakrabarti, Y. Zhan, and C. Faloutsos, "R-MAT: A recursive model for graph mining." in SDM, M. W. Berry, U. Dayal, C. Kamath, and D. B. Skillicorn, Eds. SIAM, 2004, pp. 442--446.
[18]
http://www.graph500.org/, accessed: 2017-12-31.
[19]
Ü. V. Çatalyürek, J. Feo, A. H. Gebremedhin, M. Halappanavar, and A. Pothen, "Graph coloring algorithms for multi-core and massively multithreaded architectures", Parallel Computing, vol. 38, no. 10, pp. 576--594, 2012.
[20]
"Laboratory of web algorithmics", http://law.di.unimi.it/datasets.php, accessed: January 2018.
[21]
J. Leskovec and A. Krevl, "SNAP Datasets: Stanford large network dataset collection", http://snap.stanford.edu/data, 2014.
[22]
T. A. Davis and Y. Hu, "The university of florida sparse matrix collection", ACM Trans. Math. Softw., vol. 38, no. 1, pp. 1:1--1:25.
[23]
"Graphlab git repository", https://github.com/jegonzal/PowerGraph, accessed: January 2018.
[24]
C. Xie, R. Chen, H. Guan, B. Zang, and H. Chen, "SYNC or ASYNC: Time to Fuse for Distributed Graph-parallel Computation", in 20th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, 2015.
[25]
A. H. Gebremedhin, D. Nguyen, M. M. A. Patwary, and A. Pothen, "Colpack: Software for graph coloring and related problems in scientific computing", ACM Trans. Math. Softw., vol. 40, no. 1, pp. 1:1--1:31, Oct. 2013.
[26]
D. J. Welsh and M. B. Powell, "An upper bound for the chromatic number of a graph and its application to timetabling problems", The Computer Journal, vol. 10, no. 1, pp. 85--86, 1967.
[27]
M. Deveci, E. G. Boman, K. D. Devine, and S. Rajamanickam, "Parallel graph coloring for manycore architectures", in Parallel and Distributed Processing Symposium, 2016 IEEE International. IEEE, 2016, pp. 892--901.
[28]
N. Alon, L. Babai, and A. Itai, "A fast and simple randomized parallel algorithm for the maximal independent set problem", J. Algorithms, vol. 7, no. 4, pp. 567--583, Dec. 1986.
[29]
L. Barenboim and M. Elkin, "Distributed (Δ+1)-coloring in linear (in Δ) time", in Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, ser. STOC '09. New York, NY, USA: ACM, 2009, pp. 111--120.
[30]
A. V. Goldberg, S. A. Plotkin, and G. E. Shannon, "Parallel symmetry-breaking in sparse graphs", SIAM J. Discret. Math., vol. 1, no. 4, pp. 434--446, Oct. 1988.
[31]
M. Goldberg and T. Spencer, "A new parallel algorithm for the maximal independent set problem", SIAM J. Comput., vol. 18, no. 2, pp. 419--427, Apr. 1989.
[32]
N. Linial, "Locality in distributed graph algorithms", SIAM J. Comput., vol. 21, no. 1, pp. 193--201, Feb. 1992.
[33]
J. Schneider and R. Wattenhofer, "A new technique for distributed symmetry breaking", in Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing. ACM, 2010, pp. 257--266.
[34]
L. Barenboim and M. Elkin, "Deterministic distributed vertex coloring in polylogarithmic time", Journal of the ACM (JACM), vol. 58, no. 5, p. 23, 2011.
[35]
D. Bozdağ, A. H. Gebremedhin, F. Manne, E. G. Boman, and U. V. Catalyurek, "A framework for scalable greedy coloring on distributed-memory parallel computers", Journal of Parallel and Distributed Computing, vol. 68, no. 4, pp. 515--535, 2008.
[36]
S. Salihoglu and J. Widom, "Optimizing graph algorithms on pregel-like systems", Proc. VLDB Endow., vol. 7, no. 7, pp. 577--588, Mar. 2014.
[37]
K. Vora, "Exploiting asynchrony for performance and fault tolerance in distributed graph processing", Ph.D. dissertation, UC Riverside, 2017.
Index Terms
- A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs
Index terms have been assigned to the content through auto-classification.
Recommendations
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. ...
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
Given a graph F and an integer r2, a partition F of the edge set of F into at most r classes, and a graph G, define cr,F(G) as the number of r-colorings of the edges of G that do not contain a copy of F such that the edge partition induced by the ...
Packing ( 1 , 1 , 2 , 4 )-coloring of subcubic outerplanar graphs
AbstractFor 1 ≤ s 1 ≤ s 2 ≤ … ≤ s k and a graph G, a packing ( s 1 , s 2 , … , s k ) -coloring of G is a partition of V ( G ) into sets V 1 , V 2 , … , V k such that, for each 1 ≤ i ≤ k the distance between any two ...
Comments
Information & Contributors
Information
Published In
September 2019
521 pages
ISBN:9781728136134
Sponsors
- IFIP WG 10.3: IFIP WG 10.3
- SIGARCH: ACM Special Interest Group on Computer Architecture
- IEEE-CS\DATC: IEEE Computer Society
Publisher
IEEE Press
Publication History
Published: 26 November 2024
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
PACT '19
Sponsor:
- IFIP WG 10.3
- SIGARCH
- IEEE-CS\DATC
PACT '19: International Conference on Parallel Architectures and Compilation Techniques
September 23 - 26, 2019
WA, Seattle, USA
Acceptance Rates
Overall Acceptance Rate 121 of 471 submissions, 26%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 2Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)2
Reflects downloads up to 04 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in