Abstract
The Congested Clique is a distributed-computing model for single-hop networks with restricted bandwidth that has been very intensively studied recently. It models a network by an n-vertex graph in which any pair of vertices can communicate one with another by transmitting \(O(\log n)\) bits in each round. Various problems have been studied in this setting, but for some of them the best-known results are those for general networks. For other problems, the results for Congested Cliques are better than on general networks, but still incur significant dependency on the number of vertices n. Hence the performance of these algorithms may become poor on large cliques, even though their diameter is just 1. In this paper we devise significantly improved algorithms for various symmetry-breaking problems, such as forests-decompositions, vertex-colorings, and maximal independent set.
We analyze the running time of our algorithms as a function of the arboricity a of a clique subgraph that is given as input. The arboricity is always smaller than the number of vertices n in the subgraph, and for many families of graphs it is significantly smaller. In particular, trees, planar graphs, graphs with constant genus, and many other graphs have bounded arboricity, but unbounded size. We obtain O(a)-forest-decomposition algorithm with \(O(\log a)\) time that improves the previously-known \(O(\log n)\) time, \(O(a^{2 + \epsilon })\)-coloring in \(O(\log ^* n)\) time that improves upon an \(O(\log n)\)-time algorithm, O(a)-coloring in \(O(a^{\epsilon })\)-time that improves upon several previous algorithms, and a maximal independent set algorithm with \(O(\sqrt{a})\) time that improves at least quadratically upon the state-of-the-art for small and moderate values of a.
Those results are achieved using several techniques. First, we produce a forest decomposition with a helpful structure called H-partition within \(O(\log a)\) rounds. In general graphs this structure requires \(\varTheta (\log n)\) time, but in Congested Cliques we are able to compute it faster. We employ this structure in conjunction with partitioning techniques that allow us to solve various symmetry-breaking problems efficiently.
This research has been supported by ISF grant 724/15 and Open University of Israel research fund. Full version of this paper is available online: https://arxiv.org/pdf/1802.07209.pdf.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
\(\log ^* n\) is the number of times the \(\log _2\) function has to be applied iteratively until we arrive at a number smaller than 2. That is, \(\log ^* 2 = 1\), and for \(n > 2,\) \(\log ^* n = 1 + \log ^* (\log n)\).
- 2.
The arboricity is the minimum number of forests that graph edges can be partitioned into. It always holds that \(a(G') \le \Delta (G')\), and often the arboricity of a graph is significantly smaller than its maximum degree.
References
Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, pp. 25–34 (2008)
Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. J. ACM 58(5), 23 (2011)
Barenboim, L., Khazanov, V.: Distributed symmetry-breaking in congested cliques. https://arxiv.org/pdf/1802.07209.pdf
Censor-Hillel, K., Kaski, P., Korhonenz, J., Lenzen, C., Paz, A., Suomela, J.: Algebraic methods in the congested clique. In: Proceedings of the 34th ACM Symposium on Principles of Distributed Computing, pp. 143–152 (2015)
Censor-Hillel, K., Parter, M., Schwartzman, G.: Derandomizing local distributed algorithms under bandwidth restrictions. In: Proceedings of the 31st International Symposium on Distributed Computing (2016)
Le Gall, F.: Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 57–70. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53426-7_5
Ghaffari, M.: Distributed MIS via All-to-All communication. In: Proceedings of the 36th ACM Symposium on Principles of Distributed Computing, pp. 141–149 (2017)
Ghaffari, M., Parter, M.: MST in log-star rounds of congested clique. In: 35th ACM Symposium on Principles of Distributed Computing (PODC), pp. 19–28 (2016)
Goldberg, A., Plotkin, S., Shannon, G.: Parallel symmetry-breaking in sparse graphs. SIAM J. Discrete Math. 1(4), 434–446 (1988)
Hegeman, J., Pandurangan, G., Pemmaraju, S., Sardeshmukh, V., Scquizzato, M., Toward optimal bounds in the congested clique: graph connectivity and MST. In: Proceedings 34th ACM Symposium on Principles of Distributed Computing, pp. 91–100 (2015)
Hegeman, J., Pemmaraju, S.: Lessons from the congested clique applied to mapreduce. Theor. Comput. Sci. 608, 268–281 (2015)
Jurdzinski, T., Nowicki, K.: MST in \(O(1)\) rounds of the congested clique. In: Proceedings of 29th ACM-SIAM Symposium on Discrete Algorithms, pp. 2620–2632 (2018)
Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In Proceedings of 25th ACM Symposium on Principles of Distributed Computing, pp. 7–15 (2006)
Lenzen, C.: Optimal deterministic routing and sorting on the congested clique. In: Proceedings 32nd ACM Symposium on Principles of Distributed Computing, pp. 42–50 (2013)
Linial, N.: Locality in distributed graph algorithms. SICOMP 21(1), 193–201 (1992)
Lotker, Z., Pavlov, E., Patt-Shamir, B., Peleg, D.: MST construction in \(O(\log \log n)\) communication rounds. In: the Proceedings of the Symposium on Parallel Algorithms and Architectures, pp. 94–100. ACM (2003)
Pemmaraju, S., Sardeshmukh, V.: Minimum-weight spanning tree construction in \(O(\log \log \log n)\) rounds on the congested clique. http://arxiv.org/abs/1412.2333
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Barenboim, L., Khazanov, V. (2018). Distributed Symmetry-Breaking Algorithms for Congested Cliques. In: Fomin, F., Podolskii, V. (eds) Computer Science – Theory and Applications. CSR 2018. Lecture Notes in Computer Science(), vol 10846. Springer, Cham. https://doi.org/10.1007/978-3-319-90530-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-90530-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-90529-7
Online ISBN: 978-3-319-90530-3
eBook Packages: Computer ScienceComputer Science (R0)