TY - GEN

T1 - Brief announcement

T2 - 38th ACM Symposium on Principles of Distributed Computing, PODC 2019

AU - Bitton, Shimon

AU - Emek, Yuval

AU - Izumi, Taisuke

AU - Kutten, Shay

N1 - Publisher Copyright:
© 2019 Authors.

PY - 2019/7/16

Y1 - 2019/7/16

N2 - 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.

AB - 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.

KW - Distributed algorithm

KW - Local Model

KW - Spanner

UR - http://www.scopus.com/inward/record.url?scp=85070997487&partnerID=8YFLogxK

U2 - 10.1145/3293611.3331582

DO - 10.1145/3293611.3331582

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85070997487

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 300

EP - 302

BT - PODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing

Y2 - 29 July 2019 through 2 August 2019

ER -