Document Open Access Logo

Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model

Authors Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela



PDF
Thumbnail PDF

File

LIPIcs.DISC.2021.58.pdf
  • Filesize: 463 kB
  • 4 pages

Document Identifiers

Author Details

Janne H. Korhonen
  • IST Austria, Klosterneuburg, Austria
Ami Paz
  • Faculty of Computer Science, Universität Wien, Austria
Joel Rybicki
  • IST Austria, Klosterneuburg, Austria
Stefan Schmid
  • Faculty of Computer Science, Universität Wien, Austria
  • Fraunhofer Institute for Secure Information Technology (SIT), Darmstadt, Germany
Jukka Suomela
  • Aalto University, Finland

Cite AsGet BibTex

Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, and Jukka Suomela. Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 58:1-58:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.DISC.2021.58

Abstract

We show that any algorithm that solves the sinkless orientation problem in the supported LOCAL model requires Ω(log n) rounds, and this is tight. The supported LOCAL is at least as strong as the usual LOCAL model, and as a corollary this also gives a new, short and elementary proof that shows that the round complexity of the sinkless orientation problem in the deterministic LOCAL model is Ω(log n).

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed computing models
Keywords
  • Supported LOCAL model
  • sinkless orientation
  • round elimination

Metrics

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

References

  1. Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. Lower bounds for maximal matchings and maximal independent sets. In Proc. 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2019), 2019. Google Scholar
  2. Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, and Aleksandr Tereshchenko. Locally checkable problems in rooted trees. In Proc. 40th ACM Symposium on Principles of Distributed Computing (PODC 2021), 2021. Google Scholar
  3. Alkida Balliu, Sebastian Brandt, Dennis Olivetti, and Jukka Suomela. Almost global problems in the LOCAL model. In Proc. 32nd International Symposium on Distributed Computing (DISC 2018), 2018. URL: https://doi.org/10.4230/LIPIcs.DISC.2018.9.
  4. Alkida Balliu, Sebastian Brandt, Dennis Olivetti, and Jukka Suomela. How much does randomness help with locally checkable problems? In Proc. 39th ACM Symposium on Principles of Distributed Computing (PODC 2020), 2020. URL: https://doi.org/10.1145/3382734.3405715.
  5. Alkida Balliu, Juho Hirvonen, Janne H Korhonen, Tuomo Lempiäinen, Dennis Olivetti, and Jukka Suomela. New classes of distributed time complexity. In Proc. 50th ACM Symposium on Theory of Computing (STOC 2018), 2018. URL: https://doi.org/10.1145/3188745.3188860.
  6. Béla Bollobás. Extremal graph theory. Courier Corporation, 2004. Google Scholar
  7. Sebastian Brandt. An Automatic Speedup Theorem for Distributed Problems. In Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC 2019), 2019. URL: https://doi.org/10.1145/3293611.3331611.
  8. Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, and Jara Uitto. A lower bound for the distributed Lovász local lemma. In Proc. 48th ACM Symposium on Theory of Computing (STOC 2016), 2016. URL: https://doi.org/10.1145/2897518.2897570.
  9. Sebastian Brandt, Christoph Grunau, and Václav Rozhoň. The randomized local computation complexity of the Lovász local lemma. In Proc. 40th ACM Symposium on Principles of Distributed Computing (PODC 2021), 2021. Google Scholar
  10. Yi-Jun Chang, Tsvi Kopelowitz, and Seth Pettie. An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. In Proc. 57th IEEE Symposium on Foundations of Computer Science (FOCS 2016), 2016. URL: https://doi.org/10.1109/FOCS.2016.72.
  11. Yi-Jun Chang and Seth Pettie. A Time Hierarchy Theorem for the LOCAL Model. SIAM Journal on Computing, 48(1):33-69, 2019. URL: https://doi.org/10.1137/17M1157957.
  12. Klaus-Tycho Foerster, Juho Hirvonen, Stefan Schmid, and Jukka Suomela. On the Power of Preprocessing in Decentralized Network Optimization. In Proc. IEEE Conference on Computer Communications (INFOCOM 2019), 2019. URL: https://doi.org/10.1109/INFOCOM.2019.8737382.
  13. Bernhard Haeupler, David Wajc, and Goran Zuzic. Universally-optimal distributed algorithms for known topologies. In STOC, pages 1166-1179. ACM, 2021. Google Scholar
  14. Will Rosenbaum and Jukka Suomela. Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. In Proc. 39th ACM Symposium on Principles of Distributed Computing (PODC 2020), 2020. URL: https://doi.org/10.1145/3382734.3405721.
  15. Stefan Schmid and Jukka Suomela. Exploiting locality in distributed SDN control. In Proc. ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN 2013), pages 121-126. ACM Press, 2013. URL: https://doi.org/10.1145/2491185.2491198.
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