TY - GEN
T1 - Brief Announcement
T2 - 42nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2023
AU - Agrawal, Akanksha
AU - Augustine, John
AU - Peleg, David
AU - Ramachandran, Srikkanth
N1 - Publisher Copyright:
© 2023 ACM.
PY - 2023/6/19
Y1 - 2023/6/19
N2 - We study the SUPPORTED model of distributed computing introduced by Schmid and Suomela [15], generalizing the LOCAL and CONGEST models. In this framework, multiple instances of the same problem, differing from each other by some problem specific input, recur over time, and need to be solved efficiently online. To do that, one may rely on an initial preprocessing phase for computing some useful information. This preprocessing phase makes it possible, in some cases, to obtain improved distributed algorithms, overcoming locality-based time lower bounds.We propose some natural recurrent variants of the dominating set problem and the coloring problem that are of interest particularly in the distributed setting. For these problems, we show that information about the topology can be used to overcome locality-based lower bounds. We also categorize the round complexity of Locally Checkable Labellings in the SUPPORTED model for the simple case of paths. Finally we present some interesting open problems and some partial results towards resolving them.
AB - We study the SUPPORTED model of distributed computing introduced by Schmid and Suomela [15], generalizing the LOCAL and CONGEST models. In this framework, multiple instances of the same problem, differing from each other by some problem specific input, recur over time, and need to be solved efficiently online. To do that, one may rely on an initial preprocessing phase for computing some useful information. This preprocessing phase makes it possible, in some cases, to obtain improved distributed algorithms, overcoming locality-based time lower bounds.We propose some natural recurrent variants of the dominating set problem and the coloring problem that are of interest particularly in the distributed setting. For these problems, we show that information about the topology can be used to overcome locality-based lower bounds. We also categorize the round complexity of Locally Checkable Labellings in the SUPPORTED model for the simple case of paths. Finally we present some interesting open problems and some partial results towards resolving them.
KW - distributed algorithms
KW - LOCAL Model
KW - SUPPORTED Model
UR - http://www.scopus.com/inward/record.url?scp=85163982222&partnerID=8YFLogxK
U2 - 10.1145/3583668.3594583
DO - 10.1145/3583668.3594583
M3 - Conference contribution
AN - SCOPUS:85163982222
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 172
EP - 175
BT - PODC 2023 - Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing
PB - Association for Computing Machinery
Y2 - 19 June 2023 through 23 June 2023
ER -