Cited By
View all- Robinson PMarx D(2021)Being fast means being chattyProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458190(2105-2120)Online publication date: 10-Jan-2021
Message Reduction in the LOCAL Model is a Free Lunch
Pages 300 - 302
Abstract
A new spanner construction algorithm is presented, working under the LOCAL model assuming unique edge IDs. Given an n-node communication graph, a spanner with a constant stretch and Õ(n1 + c) edges (for any small constant c > 0) is constructed efficiently --- i.e., in a constant number of rounds and a message complexity of Õ (n1 + 2c) whp.
One of the many known applications of spanners is for reducing the number of messages of various algorithms. However, usually, one still needs to pay the cost of constructing the spanner. Due to the efficiency of the spanner construction here, we show that every t-round LOCAL algorithm can be transformed into a randomized one with the same asymptotic time complexity and Õ(t2n1 + O(1/log t)) message complexity. All previous message-reduction schemes for LOCAL algorithms incur either an O(log n)-multiplicative or an O(polylog (n))-additive blow-up of the round complexity.
References
[1]
Baruch Awerbuch, Oded Goldreich, Ronen Vainish, and David Peleg. 1990. A trade-off between information and communication in broadcast protocols. Journal of the ACM (JACM) 37, 2 (1990), 238--256.
[2]
Surender Baswana and Sandeep Sen. 2007. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Structures & Algorithms 30, 4 (2007), 532--563.
[3]
Keren Censor-Hillel, Bernhard Haeupler, Jonathan Kelner, and Petar Maymounkov. 2012. Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance. In Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing (STOC). 961--970.
[4]
Bilel Derbel, Cyril Gavoille, David Peleg, and Laurent Viennot. 2009. Local Computation of Nearly Additive Spanners. In Proceedings of 23rd International Symposium on Distributed Computing (DISC). 176--190.
[5]
Michael Elkin and David Peleg. 2004. (1+∈, β)-Spanner Constructions for General Graphs. SIAM J. Comput. 33, 3 (2004), 608--631.
[6]
Bernhard Haeupler. 2015. Simple, Fast and Deterministic Gossip and Rumor Spreading. J. ACM 62, 6 (Dec. 2015), 47:1--47:18.
[7]
David Peleg. 2000. Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
[8]
David Peleg and Jeffrey D. Ullman. 1989. An Optimal Synchronizer for the Hypercube. SIAM J. Comput. 18, 4 (1989), 740--747.
Index Terms
- Message Reduction in the LOCAL Model is a Free Lunch
Recommendations
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model
Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge coloring. For most problems the best randomized algorithm is at least exponentially ...
Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering
Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper, we present a new algorithm for $(\Delta+1)$-list coloring in the randomized ${LOCAL}$ model running in $O({Det}_{\scriptscriptstyle d}(\...
Node and Edge Averaged Complexities of Local Graph Problems
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingWe continue the recently started line of work on the distributed node-averaged complexity of distributed graph algorithms. The node-averaged complexity of a distributed algorithm running on a graph G=(V,E) is the average over the times at which the ...
Comments
Information & Contributors
Information
Published In
July 2019
563 pages
Copyright © 2019 Owner/Author.
Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 16 July 2019
Check for updates
Author Tags
Qualifiers
- Announcement
Funding Sources
- MEXT KAKENHI
- JST
Conference
PODC '19: ACM Symposium on Principles of Distributed Computing
July 29 - August 2, 2019
Toronto ON, Canada
Acceptance Rates
PODC '19 Paper Acceptance Rate 48 of 173 submissions, 28%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 107Total Downloads
- Downloads (Last 12 months)8
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025
Other Metrics
Citations
Cited By
View all- Robinson PMarx D(2021)Being fast means being chattyProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458190(2105-2120)Online publication date: 10-Jan-2021
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in