@inproceedings{6283e141e96f42d39e7c4c739005ee28,
title = "Brief announcement: Message reduction in the LOCAL model is a free lunch",
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.",
keywords = "Distributed algorithm, Local Model, Spanner",
author = "Shimon Bitton and Yuval Emek and Taisuke Izumi and Shay Kutten",
note = "Publisher Copyright: {\textcopyright} 2019 Authors.; 38th ACM Symposium on Principles of Distributed Computing, PODC 2019 ; Conference date: 29-07-2019 Through 02-08-2019",
year = "2019",
month = jul,
day = "16",
doi = "10.1145/3293611.3331582",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
pages = "300--302",
booktitle = "PODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing",
}