Advertisement

On Range and Edge Capacity in the Congested Clique

  • Tomasz Jurdziński
  • Krzysztof Nowicki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10706)

Abstract

The congested clique is a synchronous, message-passing model of distributed computing in which each computational unit (node) in each round can send message of \(O(\log n)\) bits to each other node of the network, where n is the number of nodes.

Following recent progress in design of algorithms for graph connectivity and minimum spanning tree (MST) in the congested clique, we study these problems in limited variants of the congested clique. We show that MST can be computed deterministically and connected components can be computed by a randomized algorithm with optimal edge capacity \(\varTheta (\log n)\), while preserving the best known round complexity [6, 13]. Moreover, our algorithms work in the rcast model with range \(r=2\), the weakest model of the congested clique above the broadcast variant (\(r=1\)) in the hierarchy with respect to the range [2].

References

  1. 1.
    Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17–19 January 2012, pp. 459–467 (2012)Google Scholar
  2. 2.
    Becker, F., Anta, A.F., Rapaport, I., Rémila, E.: Brief announcement: a hierarchy of congested clique models, from broadcast to unicast. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastián, Spain, 21–23 July 2015, pp. 167–169 (2015)Google Scholar
  3. 3.
    Becker, F., Anta, A.F., Rapaport, I., Rémila, E.: The effect of range and bandwidth on the round complexity in the congested clique model. In: Proceedings of 22nd International Conference on Computing and Combinatorics, COCOON 2016, Ho Chi Minh City, Vietnam, 2–4 August 2016, pp. 182–193 (2016)Google Scholar
  4. 4.
    Becker, F., Montealegre, P., Rapaport, I., Todinca, I.: The simultaneous number-in-hand communication model for networks: private coins, public coins and determinism. In: Halldórsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 83–95. Springer, Cham (2014).  https://doi.org/10.1007/978-3-319-09620-9_8 Google Scholar
  5. 5.
    Drucker, A., Kuhn, F., Oshman, R.: On the power of the congested clique model. In: ACM Symposium on Principles of Distributed Computing, PODC 2014, Paris, France, 15–18 July 2014, pp. 367–376 (2014)Google Scholar
  6. 6.
    Ghaffari, M., Parter, M.: MST in log-star rounds of congested clique. In: Proceedings of PODC 2016 (2016)Google Scholar
  7. 7.
    Hegeman, J.W., Pandurangan, G., Pemmaraju, S.V., Sardeshmukh, V.B., Scquizzato, M.: Toward optimal bounds in the congested clique: graph connectivity and MST. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastián, Spain, 21–23 July 2015, pp. 91–100 (2015)Google Scholar
  8. 8.
    Hegeman, J.W., Pemmaraju, S.V.: Lessons from the congested clique applied to mapreduce. Theor. Comput. Sci. 608, 268–281 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Jurdzinski, T., Nowicki, K.: MSF and connectivity in limited variants of the congested clique. CoRR, abs/1703.02743 (2017)Google Scholar
  10. 10.
    Klauck, H., Nanongkai, D., Pandurangan, G., Robinson, P.: Distributed computation of large-scale graph problems. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4–6 January 2015, pp. 391–410 (2015)Google Scholar
  11. 11.
    Korhonen, J.H.: Deterministic MST sparsification in the congested clique. CoRR, abs/1605.02022 (2016)Google Scholar
  12. 12.
    Lenzen, C.: Optimal deterministic routing and sorting on the congested clique. In: Fatourou, P., Taubenfeld, G. (eds.) ACM Symposium on Principles of Distributed Computing, PODC 2013, Montreal, QC, Canada, 22–24 July 2013, pp. 42–50. ACM (2013)Google Scholar
  13. 13.
    Lotker, Z., Pavlov, E., Patt-Shamir, B., Peleg, D.: MST construction in o(log log n) communication rounds. In: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2003, pp. 94–100. ACM, New York (2003)Google Scholar
  14. 14.
    Montealegre, P., Todinca, I.: Brief announcement: deterministic graph connectivity in the broadcast congested clique. In: Proceedings of PODC 2016 (2016)Google Scholar
  15. 15.
    Pemmaraju, S.V., Sardeshmukh, V.B.: Super-fast MST algorithms in the congested clique using o(m) messages. In: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, 13–15 December 2016, Chennai, India, pp. 47:1–47:15 (2016)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Institute of Computer ScienceUniversity of WroclawWroclawPoland

Personalised recommendations