Document Open Access Logo

Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems

Authors Shiri Antaki, Quanquan C. Liu, Shay Solomon

PDF
Thumbnail PDF

File

LIPIcs.ITCS.2022.7.pdf
  • Filesize: 0.85 MB
  • 25 pages

Document Identifiers

Author Details

Shiri Antaki
  • Tel Aviv University, Tel Aviv, Israel
Quanquan C. Liu
  • Massachusetts Institute of Technology, Cambridge, MA, USA
Shay Solomon
  • Tel Aviv University, Tel Aviv, Israel

Funding

Shay Solomon is supported by the Israel Science Foundation (ISF) grant No.1991/1, and by a grant from the United States-Israel Binational Science Foundation (BSF), Israel, and the United States National Science Foundation (NSF).

Acknowledgements

We are grateful to Boaz Patt-Shamir for useful comments on an earlier version of this paper that helped improve its presentation.

Cite As Get BibTex

Shiri Antaki, Quanquan C. Liu, and Shay Solomon. Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 7:1-7:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.ITCS.2022.7

Abstract

The field of dynamic graph algorithms aims at achieving a thorough understanding of real-world networks whose topology evolves with time. Traditionally, the focus has been on the classic sequential, centralized setting where the main quality measure of an algorithm is its update time, i.e. the time needed to restore the solution after each update. While real-life networks are very often distributed across multiple machines, the fundamental question of finding efficient dynamic, distributed graph algorithms received little attention to date. The goal in this setting is to optimize both the round and message complexities incurred per update step, ideally achieving a message complexity that matches the centralized update time in O(1) (perhaps amortized) rounds.
Toward initiating a systematic study of dynamic, distributed algorithms, we study some of the most central symmetry-breaking problems: maximal independent set (MIS), maximal matching/(approx-) maximum cardinality matching (MM/MCM), and (Δ + 1)-vertex coloring. This paper focuses on dynamic, distributed algorithms that are deterministic, and in particular - robust against an adaptive adversary. Most of our focus is on our MIS algorithm, which achieves O (m^{2/3}log² n) amortized messages in O(log² n) amortized rounds in the Congest model. Notably, the amortized message complexity of our algorithm matches the amortized update time of the best-known deterministic centralized MIS algorithm by Gupta and Khan [SOSA'21] up to a polylog n factor. The previous best deterministic distributed MIS algorithm, by Assadi et al. [STOC'18], uses O(m^{3/4}) amortized messages in O(1) amortized rounds, i.e., we achieve a polynomial improvement in the message complexity by a polylog n increase to the round complexity; moreover, the algorithm of Assadi et al. makes an implicit assumption that the network is connected at all times, which seems excessively strong when it comes to dynamic networks. Using techniques similar to the ones we developed for our MIS algorithm, we also provide deterministic algorithms for MM, approximate MCM and (Δ + 1)-vertex coloring whose message complexities match or nearly match the update times of the best centralized algorithms, while having either constant or polylog(n) round complexities.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Theory of computation → Dynamic graph algorithms
Keywords
  • dynamic graph algorithms
  • distributed algorithms
  • symmetry breaking problems
  • maximal independent set
  • matching
  • coloring

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Noga Alon, László Babai, and Alon Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7(4):567-583, 1986. URL: https://doi.org/10.1016/0196-6774(86)90019-2.
  2. Shiri Antaki, Quanquan C. Liu, and Shay Solomon. Near-optimal distributed implementations of dynamic algorithms for symmetry-breaking problems. CoRR, abs/2010.16177, 2020. URL: http://arxiv.org/abs/2010.16177.
  3. Sepehr Assadi, Krzysztof Onak, Baruch Schieber, and Shay Solomon. Fully dynamic maximal independent set with sublinear update time. In Ilias Diakonikolas, David Kempe, and Monika Henzinger, editors, Proc. of 50th STOC, pages 815-826. ACM, 2018. Google Scholar
  4. Sepehr Assadi, Krzysztof Onak, Baruch Schieber, and Shay Solomon. Fully dynamic maximal independent set with sublinear in n update time. In Timothy M. Chan, editor, Proc. of 30th SODA, pages 1919-1936, 2019. Google Scholar
  5. Philipp Bamberger, Fabian Kuhn, and Yannic Maus. Local distributed algorithms in highly dynamic networks. In 2019 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2019, Rio de Janeiro, Brazil, May 20-24, 2019, pages 33-42. IEEE, 2019. URL: https://doi.org/10.1109/IPDPS.2019.00015.
  6. Leonid Barenboim, Michael Elkin, and Uri Goldenberg. Locally-iterative distributed (δ+ 1): Coloring below szegedy-vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC '18, pages 437-446, New York, NY, USA, 2018. Association for Computing Machinery. URL: https://doi.org/10.1145/3212734.3212769.
  7. Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, and Madhu Sudan. Fully dynamic maximal independent set with polylogarithmic update time. In David Zuckerman, editor, Proc. of 60th FOCS, pages 382-405, 2019. Google Scholar
  8. Larry Carter and Mark N. Wegman. Universal classes of hash functions. In Proc. 9th STOC, pages 106-112, 1977. Google Scholar
  9. Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, and Gregory Schwartzman. Fast deterministic algorithms for highly-dynamic networks. In Quentin Bramas, Rotem Oshman, and Paolo Romano, editors, 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference), volume 184 of LIPIcs, pages 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.OPODIS.2020.28.
  10. Keren Censor-Hillel, Elad Haramaty, and Zohar S. Karnin. Optimal dynamic distributed MIS. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016, pages 217-226, 2016. Google Scholar
  11. Keren Censor-Hillel, Merav Parter, and Gregory Schwartzman. Derandomizing local distributed algorithms under bandwidth restrictions. Distributed Comput., 33(3):349-366, 2020. URL: https://doi.org/10.1007/s00446-020-00376-1.
  12. Shiri Chechik and Tianyi Zhang. Fully dynamic maximal independent set in expected poly-log update time. In David Zuckerman, editor, Proc. of 60th FOCS, pages 370-381, 2019. Google Scholar
  13. Yuhao Du and Hengjie Zhang. Improved algorithms for fully dynamic maximal independent set. CoRR, abs/1804.08908, 2018. Google Scholar
  14. Mohsen Ghaffari, Christoph Grunau, and Václav Rozhon. Improved deterministic network decomposition. CoRR, abs/2007.08253, 2020. URL: http://arxiv.org/abs/2007.08253.
  15. Manoj Gupta and Shahbaz Khan. Simple dynamic algorithms for maximal independent set and other problems. SOSA '21, abs/1804.01823, 2021. Google Scholar
  16. J. E. Hopcroft and R. M. Karp. An n^5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2(4):225-231, 1973. Google Scholar
  17. Haim Kaplan and Shay Solomon. Dynamic representations of sparse distributed networks: A locality-sensitive approach. In Christian Scheideler and Jeremy T. Fineman, editors, Proc. of 30th SPAA 2018, pages 33-42, 2018. Google Scholar
  18. Bruce M. Kapron, Valerie King, and Ben Mountjoy. Dynamic graph connectivity in polylogarithmic worst case time. In Proc. of 24th SODA, pages 1131-1142, 2013. Google Scholar
  19. Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, and Sai Mohith Potluri. Trade-offs in dynamic coloring for bipartite and general graphs, 2020. URL: http://arxiv.org/abs/1909.07854.
  20. Ken-ichi Kawarabayashi and Gregory Schwartzman. Adapting Local Sequential Algorithms to the Distributed Setting. In Ulrich Schmid and Josef Widder, editors, 32nd International Symposium on Distributed Computing (DISC 2018), volume 121 of Leibniz International Proceedings in Informatics (LIPIcs), pages 35:1-35:17, Dagstuhl, Germany, 2018. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: https://doi.org/10.4230/LIPIcs.DISC.2018.35.
  21. Michael König and Roger Wattenhofer. On local fixing. In Principles of Distributed Systems - 17th International Conference, OPODIS 2013, Nice, France, December 16-18, 2013. Proceedings, volume 8304 of Lecture Notes in Computer Science, pages 191-205. Springer, 2013. URL: https://doi.org/10.1007/978-3-319-03850-6_14.
  22. Nathan Linial. Distributive graph algorithms-global solutions from local data. In Proceedings of the 28th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1987, Los Angeles, CA, USA, October 27-29, 1987, pages 331-335, 1987. Google Scholar
  23. Zvi Lotker, Boaz Patt-Shamir, and Adi Rosén. Distributed approximate matching. SIAM J. Comput., 39(2):445-460, 2009. Google Scholar
  24. Michael Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15(4):1036-1053, 1986. Google Scholar
  25. Ofer Neiman and Shay Solomon. Simple deterministic algorithms for fully dynamic maximal matching. In Proceedings of the 45th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2013, Palo Alto, CA, USA, June 1-4, 2013, pages 745-754, 2013. Google Scholar
  26. Merav Parter, David Peleg, and Shay Solomon. Local-on-average distributed tasks. In Robert Krauthgamer, editor, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 220-239, 2016. Google Scholar
  27. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000. Google Scholar
  28. D. Peleg and S. Solomon. Dynamic (1 + ε)-approximate matchings: A density-sensitive approach. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, 2016. Google Scholar
  29. Václav Rozhon and Mohsen Ghaffari. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath, and Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pages 350-363. ACM, 2020. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact