Abstract
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.
Original language | English |
---|---|
Title of host publication | PODC 2023 - Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing |
Publisher | Association for Computing Machinery |
Pages | 172-175 |
Number of pages | 4 |
ISBN (Electronic) | 9798400701214 |
DOIs | |
State | Published - 19 Jun 2023 |
Externally published | Yes |
Event | 42nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2023 - Orlando, United States Duration: 19 Jun 2023 → 23 Jun 2023 |
Publication series
Name | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing |
---|
Conference
Conference | 42nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2023 |
---|---|
Country/Territory | United States |
City | Orlando |
Period | 19/06/23 → 23/06/23 |
Bibliographical note
Publisher Copyright:© 2023 ACM.
Funding
David Peleg holds the Venky Harinarayanan and Anand Rajara-man (VHAR) Visiting Chair Professorship at IIT Madras. This work was carried out in part during mutual visits that were supported by the VHAR Visiting Chair funds. John Augustine and Srikkanth Ramachandran are supported by the Centre of Excellence in Cryptography, Cybersecurity, and Distributed Trust (CCD) and by an IITM-Accenture project (SB/22-23/007/JOHN/ACC).
Funders | Funder number |
---|---|
Centre of Excellence in Cryptography | |
Distributed Trust | |
IITM-Accenture | SB/22-23/007/JOHN/ACC |
ARC Centre of Excellence in Cognition and its Disorders |
Keywords
- LOCAL Model
- SUPPORTED Model
- distributed algorithms