research-article

Brief Announcement: Round eliminator: a tool for automatic speedup simulation

Author:

Dennis OlivettiAuthors Info & Claims

PODC '20: Proceedings of the 39th Symposium on Principles of Distributed Computing

Pages 352 - 354

https://doi.org/10.1145/3382734.3405694

Published: 31 July 2020 Publication History

Get Access

Abstract

In the last years, the round elimination technique has been successfully used to prove many lower bounds for the LOCAL model of distributed computing. In 2019, Brandt proved that this technique can be theoretically automated: given a locally checkable problem Π that can be solved in T rounds of communication, it is possible to mechanically define a problem Π′ that requires T − 1 rounds, and by repeating this procedure many times one can obtain interesting lower and upper bounds.

In this work, we show that this technique can be automated also in practice: round eliminator is a computer program where we can feed our favorite locally checkable problem and obtain lower (and sometimes upper) bounds for it, automatically.

References

[1]

Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, and Jukka Suomela. 2019. Classification of distributed binary labeling problems. CoRR abs/1911.13294 (2019).

Google Scholar

[2]

Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. 2019. Lower bounds for maximal matchings and maximal independent sets. In Proc. 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2019). IEEE, 481--497.

Crossref

Google Scholar

[3]

Alkida Balliu, Sebastian Brandt, and Dennis Olivetti. 2020. Distributed Lower Bounds for Ruling Sets. CoRR abs/2004.08282 (2020).

Google Scholar

[4]

Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, and Jukka Suomela. 2019. Locality of Not-so-Weak Coloring. In Proc. 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019) (Lecture Notes in Computer Science, Vol. 11639). Springer, 37--51.

Digital Library

Google Scholar

[5]

Alkida Balliu, Juho Hirvonen, Dennis Olivetti, and Jukka Suomela. 2019. Hardness of Minimal Symmetry Breaking in Distributed Computing. In Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC 2019). ACM Press, 369--378.

Digital Library

Google Scholar

[6]

Sebastian Brandt. 2019. An Automatic Speedup Theorem for Distributed Problems. In Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC 2019). ACM Press, 379--388.

Digital Library

Google Scholar

[7]

Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, and Jara Uitto. 2016. A lower bound for the distributed Lovász local lemma. In Proc. 48th ACM Symposium on Theory of Computing (STOC 2016). ACM Press, 479--488.

Digital Library

Google Scholar

[8]

Sebastian Brandt and Dennis Olivetti. 2020. Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants. In Proc. 39th ACM Symposium on Principles of Distributed Computing (PODC 2020). ACM Press.

Digital Library

Google Scholar

[9]

Nathan Linial. 1992. Locality in Distributed Graph Algorithms. SIAM J. Comput. 21, 1 (1992), 193--201.

Digital Library

Google Scholar

[10]

Moni Naor. 1991. A lower bound on probabilistic algorithms for distributive ring coloring. SIAM Journal on Discrete Mathematics 4, 3 (1991), 409--412.

Digital Library

Google Scholar

[11]

Dennis Olivetti. 2020. Round Eliminator: a tool for automatic speedup simulation. https://github.com/olidennis/round-eliminator

Google Scholar

Cited By

View all

Maus Y(2023)Distributed Graph Coloring Made EasyACM Transactions on Parallel Computing10.1145/360589610:4(1-21)Online publication date: 17-Aug-2023
https://dl.acm.org/doi/10.1145/3605896
Balliu ABrandt SChang YOlivetti DStudený JSuomela JTereshchenko A(2022)Locally checkable problems in rooted treesDistributed Computing10.1007/s00446-022-00435-936:3(277-311)Online publication date: 22-Aug-2022
https://doi.org/10.1007/s00446-022-00435-9
Balliu ABrandt SOlivetti DStudený JSuomela JTereshchenko AMiller ACensor-Hillel K(2021)Locally Checkable Problems in Rooted TreesProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467934(263-272)Online publication date: 23-Jul-2021
https://doi.org/10.1145/3465084.3467934
Show More Cited By

Index Terms

Brief Announcement: Round eliminator: a tool for automatic speedup simulation
1. Theory of computation
  1. Design and analysis of algorithms
    1. Distributed algorithms
  2. Models of computation
    1. Concurrency
      1. Distributed computing models

Recommendations

Distributed ∆-coloring plays hide-and-seek
STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing

We prove several new tight or near-tight distributed lower bounds for classic symmetry breaking problems in graphs. As a basic tool, we first provide a new insightful proof that any deterministic distributed algorithm that computes a Δ-coloring on Δ-...
Tight Lower Bounds in the Supported LOCAL Model
PODC '24: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing

In this work, we study the complexity of fundamental distributed graph problems in the recently popular setting where information about the input graph is available to the nodes before the start of the computation. We focus on the most common such ...
Brief Announcement: Tight Bounds for Repeated Balls-into-Bins
SPAA '22: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
We study the repeated balls-into-bins process introduced by Becchetti, Clementi, Natale, Pasquale and Posta [3]. This process starts with m balls arbitrarily distributed across n bins. At each step t = 1, 2, . . ., we select one ball from each non-empty ...

Comments

Information & Contributors

Information

Published In

PODC '20: Proceedings of the 39th Symposium on Principles of Distributed Computing

July 2020

539 pages

ISBN:9781450375825

DOI:10.1145/3382734

General Chair:
Yuval Emek
Technion, Israel
,
Program Chair:
Christian Cachin
University of Bern, Switzerland

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 July 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Academy of Finland

Conference

PODC '20

Sponsor:

PODC '20: ACM Symposium on Principles of Distributed Computing

August 3 - 7, 2020

Virtual Event, Italy

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
77
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Maus Y(2023)Distributed Graph Coloring Made EasyACM Transactions on Parallel Computing10.1145/360589610:4(1-21)Online publication date: 17-Aug-2023
https://dl.acm.org/doi/10.1145/3605896
Balliu ABrandt SChang YOlivetti DStudený JSuomela JTereshchenko A(2022)Locally checkable problems in rooted treesDistributed Computing10.1007/s00446-022-00435-936:3(277-311)Online publication date: 22-Aug-2022
https://doi.org/10.1007/s00446-022-00435-9
Balliu ABrandt SOlivetti DStudený JSuomela JTereshchenko AMiller ACensor-Hillel K(2021)Locally Checkable Problems in Rooted TreesProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467934(263-272)Online publication date: 23-Jul-2021
https://doi.org/10.1145/3465084.3467934
Balliu ABrandt SKuhn FOlivetti DMiller ACensor-Hillel K(2021)Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in TreesProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467901(283-293)Online publication date: 23-Jul-2021
https://doi.org/10.1145/3465084.3467901
Balliu ABrandt SHirvonen JOlivetti DRabie MSuomela J(2021)Lower Bounds for Maximal Matchings and Maximal Independent SetsJournal of the ACM10.1145/346145868:5(1-30)Online publication date: 31-Oct-2021
https://doi.org/10.1145/3461458
Brandt SKeller BRybicki JSuomela JUitto JAgrawal KAzar Y(2021)Efficient Load-Balancing through Distributed Token DroppingProceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3409964.3461785(129-139)Online publication date: 6-Jul-2021
https://doi.org/10.1145/3409964.3461785
Suomela J(2020)Using Round Elimination to Understand LocalityACM SIGACT News10.1145/3427361.342737451:3(63-81)Online publication date: 29-Sep-2020
https://doi.org/10.1145/3427361.3427374

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Distributed ∆-coloring plays hide-and-seek

Tight Lower Bounds in the Supported LOCAL Model

Brief Announcement: Tight Bounds for Repeated Balls-into-Bins

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations